VIII

最新推荐文章于 2023-10-24 12:18:14 发布

ashrkq

最新推荐文章于 2023-10-24 12:18:14 发布

阅读量334

点赞数

分类专栏：栈和队列

本文链接：https://blog.csdn.net/wjhuihuii/article/details/52079760

版权

栈和队列专栏收录该内容

8 篇文章 0 订阅

订阅专栏

VIII

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

就是一个队列一直添加元素在某个时候问你第k大的元素是什么

定义一个优先队列存入k个元素如果有大的元素就让最小的出列然后再让那个入列

#include<cstdio>
#include<queue>
using namespace std;
struct node{
	int x;
	bool friend operator <(node a,node b){
		return a.x>b.x;//优先小的元素
	}
}a;
int n,k;
int main(){
	while(~scanf("%d %d",&n,&k)){
		priority_queue<node> cnt;
		char s[5];
		for(int i=0;i<n;i++){
			scanf("%s",s);
			if(s[0]=='I'){
				scanf("%d",&a.x);
				cnt.push(a);
				if(cnt.size()>k)//判断队列中的元素是否超过了k个
					cnt.pop();
			}
			else{
				a=cnt.top();
				printf("%d\n",a.x);
			}
		}
	}
	return 0;
}