杭电 4006 The kth great number（优先队列）

 The kth great number

Time Limit:1000MS     Memory Limit:65768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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<=n<=1000000). 
 给出n,m;代表n次操作，找出第m大的数，I代表输入，Q代表输出;

构建一个优先队列，从大到小排序，但队列中只保存m个数，这样每输出最上层的数字，就为第m大数学;

#include <iostream>
#include<queue>
#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
int n,m,k,sum=0;
char ch[10];
int main()
{
while(~scanf("%d%d",&n,&m))
{priority_queue<int,vector<int>,greater<int> >q;//优先队列，从大到小
	sum=0;
for(int i=0;i<n;i++)
{scanf("%s",ch);
	if(ch[0]=='I')//判断操作方式
	{scanf("%d",&k);
		q.push(k);
		sum++;//只存m个数
		if(sum>m)
		{q.pop();
		sum--;}
	}
	else
	printf("%d\n",q.top());
}
}}