【HDU 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): 13728    Accepted Submission(s): 5357

 

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 3 I 1 I 2 I 3 Q I 5 Q I 4 Q

 

 

Sample Output

1 2 3

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的时候，推出栈顶（这样保证了时刻在更新第k大的值），对于每次询问，直接输出栈顶元素即可。

#include
#include
#include
using namespace std;
priority_queue,greater > que;
char s;
int main()
{
	ios::sync_with_stdio(0);
	int n,k;
	while(cin>>n>>k)
	{
		while(!que.empty())
		{
			que.pop();
		}
		int num;
		for(int i=0;i>s;
			if(s=='I')
			{
				cin>>num;
				que.push(num);
				if(que.size()>k)
				{
					que.pop();
				}
			}
			else if(s=='Q')
			{
				cout<