hdu4006 The kth great number 优先队列

8 3
I 1
I 2
I 3
Q
I 5
Q
I 4
Q

1
2
3

HintXiao  Ming  won't  ask  Xiao  Bao  the  kth  great  number  when  the  number  of  the  written number is smaller than k. (1=<k<=n<=1000000).

/*
━━━━━┒
┓┏┓┏┓┃μ'sic foever!!
┛┗┛┗┛┃＼○／
┓┏┓┏┓┃ /
┛┗┛┗┛┃ノ)
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┃┃┃┃┃┃
┻┻┻┻┻┻
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;
const int maxn=1000010;
const int inf=1<<30;
int c[maxn];
int lowbit(int x){
return x&(-x);
}

void update(int x,int val){
while(x<=maxn){
c[x] += val;
x += lowbit(x);
}
}

int getsum(int x){
int sum=0;
while(x>0){
sum += c[x];
x -=lowbit(x);
}
return sum;
}
bool compare(int a,int b){
return a>b;
}

int main(){
int k,n,i,j,number;
string str;
while(~scanf("%d%d",&n,&k)){
priority_queue<int,vector<int>,greater<int> > save;
for(i=1;i<=n;i++){
cin>>str;
if(str=="I"){
scanf("%d",&number);
if(save.size()<k){
save.push(number);
}else{
if(number>save.top()){
save.pop();
save.push(number);
}
}
}else{
printf("%d\n",save.top());
}
}
}

return 0;
}