#include <iostream>
#include <stdio.h>
#include <queue>
using namespace std;
int main(){
int n,k,i,num;
char c;
while(scanf("%d %d",&n,&k)!=EOF){
priority_queue<int, vector<int>, greater<int> > q;
for(i=0;i<k;i++){
cin>>c;
cin>>num;
q.push(num);
}
for(i=k;i<n;i++){
cin>>c;
if(c=='I'){
scanf("%d",&num);
if(num>q.top()){
q.pop();
q.push(num);
}
}
if(c=='Q'){
printf("%d\n",q.top());
}
}
}
return 0;
}
ACM暑期集训——专题一[优先队列]
最新推荐文章于 2024-04-27 11:13:02 发布