hdu 4006 第K大的数（优先队列）

N次操作 I是插入一个数 Q是输出第K大的数

Sample Input
8 3 //n k
I 1
I 2
I 3
Q
I 5
Q
I 4
Q

Sample Output
1
2
3

 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <algorithm>
 # include <string>
 # include <cmath>
 # include <queue>
 # include <list>
 # define LL long long
 using namespace std ;

 struct ss
 {
     friend bool operator<(const ss a,const ss b)
     {
         if(a.v>b.v)
             return ;
         else
             return ;
     }
     int v;
 };

 int main()
 {
     //freopen("in.txt","r",stdin) ;
     int n , k ;
     char s[];
     while(scanf("%d %d" , &n , &k) != EOF)
     {
         priority_queue<ss> q ;
         ss t;
         while(n--)
         {
             scanf("%s",s);
             if(s[]=='I')
             {
                 int a;
                 scanf("%d",&a);
                 t.v=a;
                 q.push(t);
                 if(q.size()>k)
                 {
                     q.pop();
                 }
             }
             else
             {
                 printf("%d\n",q.top());
             }
         }
     }

     return ;
 }