HDU 4006 The kth great number 【优先队列求第K大数】
来源:互联网 发布:知乎 经典电影 编辑:程序博客网 时间:2024/09/21 08:17
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 7004 Accepted Submission(s): 2857
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 3I 1I 2I 3QI 5QI 4Q
Sample Output
123
priority_queue<int,vector<int>,greater<int> >q;
greater算子,由小到大出队列
less算子,由大到小出队列
*/
#include<cstdio>#include<queue>#include<vector>using namespace std;priority_queue<int,vector<int>,greater<int> >q;int main(){ int n,k,x; char c; while(scanf("%d %d",&n,&k)!=EOF) { while(!q.empty()) q.pop(); while(n--) { getchar(); scanf("%c",&c); if(c=='I') { scanf("%d",&x); q.push(x); } while(q.size()>k) q.pop(); if(c=='Q') { printf("%d\n",q.top()); } } } return 0;}
0 0
- HDU 4006 The kth great number 【优先队列求第K大数】
- HDU 4006 The kth great number(优先队列·第K大数)
- Hdu 4006 The kth great number (第k大元素 优先队列的几种写法)
- The kth great number(第k大数模板题:优先队列或树状数组或SBT)
- hdu 4006 The kth great number(使用优先队列)
- HDU 4006 The kth great number(优先队列、堆实现)
- HDU 4006 The kth great number (堆实现优先队列)
- HDU 4006 The kth great number(优先队列)
- HDU 4006 The kth great number(优先队列)
- hdu 4006 The kth great number(优先队列)
- hdu 4006 The kth great number 优先队列
- HDU-#4006 The kth great number(优先队列)
- HDU 4006 The kth great number【优先队列】
- hdu 4006 The kth great number(优先队列)
- HDU 4006 The kth great number(优先队列)
- hdu杭电4006 The kth great number【优先队列】
- hdu 4006 The kth great number(线段树 || 优先队列)
- HDU 4006 The kth great number(优先队列)
- 九度OJ 1058 反序输出
- Flex 全屏
- C# 读取xml文件忽略xml文件的注释
- ios 初学小结
- 97去掉ScrollVIew拉到尽头时再拉的阴影效果
- HDU 4006 The kth great number 【优先队列求第K大数】
- Excel Sheet Column Number (Java)
- java操作xml----dom4j
- unity3D__总结
- 【一步步学习MongoDB】——MongoDB简单介绍(一)
- 2014年的最后一天
- 回顾2014,设想2015
- 『HTML5梦幻之旅』 - 跟随歌曲显示当前歌词
- getopt() 函数使用方法