题目链接: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).