hdu 4006 优先队列 2011大连赛区网络赛F **

签到题都要想一会

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cmath>
 #include<queue>
 #include<map>
 using namespace std;
 #define MOD 1000000007
 const int INF=0x3f3f3f3f;
 const double eps=1e-;
 typedef long long ll;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 const int MAXN=;
 int n,m,tt;
 priority_queue<int,vector<int>,greater<int> > q;
 int main()
 {
     int i,j,k;
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     char s[];
     while(~scanf("%d%d",&m,&k))
     {
         int x;
         while(!q.empty())    q.pop();
         for(i=;i<m;i++)
         {
             scanf("%s",s);
             if(s[]=='I')
             {
                 scanf("%d",&x);
                 if(q.size()<k)  q.push(x);
                 else if(q.top()<x)
                 {
                     q.pop();
                     q.push(x);
                 }
             }
             else printf("%d\n",q.top());
         }
     }
 }