HDU - 4006 The kth great number

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<=n<=1000000).
        
 

 

题目大意：写下n个数，和第k大的数，输入I时写下数字 ，输入Q时，输出当前写下的数字中第k大的数；

解题思路：使用优先队列来做，使位于数最小的位于队首，并且让队列中一直保持k个数，这样每次输出队首元素就可以了

AC代码：

#include<iostream>
#include<queue>
using namespace std;
int main()
{
	
	int n,k,x;
	char c;
	while(cin>>n>>k)
	{
		priority_queue<int,vector<int>,greater<int> > q;
		for(int i=0;i<n;i++)
		{
			cin>>c;
			if(c=='I')
			{
				cin>>x;
				q.push(x);
				if(q.size()>k)//大于k就弹出队首元素 
					q.pop();
			}
			if(c=='Q')
			{
				x=q.top();
				cout<<x<<endl;
			}
		}
	}
	return 0;
}