杭电4006 The kth great number

The kth great number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 8343    Accepted Submission(s): 3292

Problem Description

Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao what the kth great number is. Because the number written by Xiao Ming is too much, Xiao Bao is feeling giddy. Now, try to help Xiao Bao.

 

Input

There are several test cases. For each test case, the first line of input contains two positive integer n, k. Then n lines follow. If Xiao Ming choose to write down a number, there will be an " I" followed by a number that Xiao Ming will write down. If Xiao Ming choose to ask Xiao Bao, there will be a "Q", then you need to output the kth great number.

 

Output

The output consists of one integer representing the largest number of islands that all lie on one line.

 

Sample Input

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

 

Sample Output

123
Hint
Xiao  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).
 
恩，题目大意就是说每次给两个数，分别表示该组数据的个数以及k.恩，这题让求的就是添加一些数，让求第k个大的数。
设置优先队列按从小到大排，队列的元素总共只有k个，则队首元素就一直是第k大的数，若队列元素个数大于k就删除队首元素直到只有k个元素为止。呃，还是看代码吧
然后提交时c++竟然CE了了了了，然后换成G++就ok 了。。。
#include<cstdio>#include<cstring>#include<queue>#include<algorithm>using namespace std;int main(){int n,k,m;char s[10];while(~scanf("%d %d",&n,&k)){priority_queue<int,vector<int>,greater<int> >q;//貌似是因为C++里没这玩意儿while(n--){scanf("%s",s);//getchar();scanf("%c",&c);if(s[0]=='I'){scanf("%d",&m);q.push(m);if(q.size()>k)q.pop();}else if(s[0]=='Q')printf("%d\n",q.top());}}return 0;}