HDU 4006 The kth great number 【优先队列】

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4006

思路:题比较的水,输出第k大的数就可以了。【分析一下,比如你已经将1 2 3这三个数存到队列中了,你的k=3,也就是让你输出第三大的数,这时你要是再输入一个4,这时候把队首元素1出栈,4进栈,重新排序之后队首元素就为2,也就是你的第三大的数,其余的分析类似】代码如下:

#include<bits/stdc++.h>
#include<queue> 
using namespace std;
int main()
{
	int n,k;
	char s;
	while(cin>>n>>k)
	{
		priority_queue<int,vector<int>, greater<int> >que;  //按照由小到大的顺序排序 
		while(!que.empty())
		    que.pop();
		while(n--){
		cin>>s;
		if(s=='I')
		{
			int a;
			cin>>a;
			que.push(a);
			if(que.size()>k)
			   que.pop();
		}
		else
		    cout<<que.top()<<endl;
	}
}
	return 0;
}

ps:提莫队长前来待命!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 14121    Accepted Submission(s): 5485

 

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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值