hdu 4006 The kth great number

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4006

思路：利用优先队列的性质，将数据存入后会自动对数据进行排序

#include<stdlib.h>
#include<time.h>
#include <cstdio>  
#include <cstring>  
#include <cmath>  
#include <cstdlib>  
#include <ctime>  
#include <iostream>  
#include <algorithm>  
#include <vector>  
#include <queue>  
#include <map>  
#include <set>  
#include <string>  
using namespace std;

int main()
{
    int n,k,a;
    string str;
    while(scanf("%d %d",&n,&k)!=EOF)
    {
        priority_queue<int,vector<int>,greater<int> > q;
        while(n--)
        {
            cin>>str;
             if(str.at(0) == 'I')
             {
                 scanf("%d",&a);
                 q.push(a);
                 if(q.size()>k)
                 q.pop();
             }
             else
                 cout<<q.top()<<endl;
        }
    }
    return 0;
}