hdu 4006 The kth great number(优先队列)
来源:互联网 发布:mac免费视频编辑软件 编辑:程序博客网 时间:2024/05/22 07:54
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 6982 Accepted Submission(s): 2837
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
123HintXiao 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
Recommend
lcy | We have carefully selected several similar problems for you: 4003 4007 4004 4008 4005
题意:n个操作,‘I’表示插入值,Q则问你第k大数是多少。
题解:
优先队列 priority_queue<int, vector<int>, greater<int> >的使用,每插入一个数都保存前k大的数,队首就为第k大的数。
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<string>#include<algorithm>#include<cstdlib>#include<set>#include<queue>#include<stack>#include<vector>#include<map>#define N 100010#define Mod 10000007#define lson l,mid,idx<<1#define rson mid+1,r,idx<<1|1#define lc idx<<1#define rc idx<<1|1typedef long long ll;const int INF = 1000010;using namespace std;int main(){ int n, k; while ( cin >> n >> k ) { char c; int s; priority_queue<int, vector<int>, greater<int> >que;///从大到小排序,队首尾最小值 while ( n-- ) { scanf ( "%c%*c", &c ); if ( c == 'Q' ) printf ( "%d\n", que.top() ); else { scanf ( "%d", &s ); que.push ( s ); if ( que.size() > k ) que.pop(); getchar(); } } } return 0;}
0 0
- 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(优先队列)
- HDU 4006 The kth great number (优先队列)
- 【HDU 4006】The kth great number(优先队列)
- HDU 4006 The kth great number (优先队列)
- 【HDU】-4006-The kth great number(优先队列,好)
- asp.net中BulletedList实现导航栏实例
- leedcode:Search in Rotated Sorted Array
- CSS选择器中的空格
- A*算法步骤
- 组合线程安全类
- hdu 4006 The kth great number(优先队列)
- Cocos2d-X开发中国象棋《十二》游戏结果的显示与隐藏
- 功能仿真与时序仿真,及Modelsim的使用
- Android中Looper、Handler、MessageQueue源码不完全分析
- 软回车变回车 上下标符号
- 使用局部标准差实现图像的局部对比度增强算法。
- 20141127-OrCAD16.6中对比两份DSN文件的方法
- Android电话本核心数据结构
- 括号配对问题