首页 > 代码库 > HDU 4006 优先队列
HDU 4006 优先队列
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 10390 Accepted Submission(s): 4153
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).
Source
The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest
题意：
共有n种操作，I插入一个数，Q询问第K大的数是几。
代码：
学会了优先队列
1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<queue> 5 #include<functional> 6 #include<vector> 7 using namespace std; 8 int n,k; 9 int main()10 {11 char ch[5];12 int x;13 while(scanf("%d%d",&n,&k)!=EOF)14 {15 priority_queue<int,vector<int>,greater<int> >que;16 while(n--)17 {18 scanf("%s",ch);19 if(ch[0]==‘I‘)20 {21 scanf("%d",&x);22 que.push(x);23 }24 else25 {26 printf("%d\n",que.top());27 }28 if(que.size()>k)29 que.pop();30 }31 }32 return 0;33 }
HDU 4006 优先队列
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。