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).
        
 

可以换种思路，既然是求第几大的数字，那么可以利用优先队列，且始终保持队列中
只有K个数，多余的在加入队列排序后就清除掉，最后只要取出队首的元素就找到答案了

#include<stdio.h>
#include<iostream>
#include<queue>
#include<vector>
#include<string.h>
#include<algorithm>
using namespace std;
//priority_queue<int,vector<int>,less<int> >q;	<--
//priority_queue<int,vector<int>,greater<int> >q;
int main()
{
	int n,k;
	while(scanf("%d %d",&n,&k)!=EOF)
	{
		char c[10];//最好用字符串输入I,Q，要不莫名出错
		int m;
		priority_queue<int,vector<int>,greater<int> >q;
		for (int i=1;i<=n;i++)
		{
			scanf("%s",c);
			if (strcmp(c,"I")==0)
			{
				scanf("%d",&m);
				q.push(m);
				if (q.size()>k)
					q.pop();
			}
			if (strcmp(c,"Q")==0)
				printf("%d\n",q.top());
		}
	}
	return 0;
}