HDU 4006 The kth great number (优先队列)

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
int main()
{
    int n,k;
    char s[15];
    while(cin>>n>>k)
    {
        priority_queue<int,vector<int>,greater<int> >q;
        int num;
        while(n--)
        {
            cin>>s;
            if(s[0]==‘I‘)
            {
                cin>>num;
                if(q.size()<k)
                {
                    q.push(num);
                }
                else if(q.top()<num)
                {
                    q.pop();
                    q.push(num);
                }
            }
            else
                cout<<q.top()<<endl;
        }
    }
    return 0;
}