hdu 4006 The kth great number,set,priority_queue
来源:互联网 发布:php验证码怎么实现 编辑:程序博客网 时间:2024/05/07 04:04
The kth great number
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
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).
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.
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).
用set或者priority_queue维护长度为k从小到大有序的序列,每次查询的时候首元素即为所求。
#include <cstdio>#include <set>#include <map>#include <vector>#include <iostream>using namespace std;multiset<int> ms;int main(){ int n, k, x; char ch[10]; while(~scanf("%d%d", &n, &k)) { ms.clear(); while(n--) { scanf("%s", ch); if(ch[0]=='I') { scanf("%d",&x); ms.insert(x); if(ms.size()>k) { ms.erase(ms.begin()); } } else { printf("%d\n", *ms.begin()); } } } return 0;}
#include <cstdio>#include <set>#include <map>#include <vector>#include <queue>#include <iostream>using namespace std;priority_queue<int,vector<int>, greater<int> > pq;int main(){ int n, k, x; char ch[10]; while(~scanf("%d%d", &n, &k)) { while(!pq.empty()) pq.pop(); while(n--) { scanf("%s", ch); if(ch[0]=='I') { scanf("%d",&x); pq.push(x); if(pq.size()>k) { pq.pop(); } } else { printf("%d\n", pq.top()); } } } return 0;}
0 0
- hdu 4006 The kth great number,set,priority_queue
- HDU-4006 The kth great number(STL基础 priority_queue)
- HDU - 4006 The kth great number (set&数据结构)
- 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 treap
- 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/SBT
- IOS的四种数据持久化
- H.264结构
- HashTable,HashMap,LIST,SET,MAP的区别和联系
- 阿里向左,微信向右
- Linux命令--df
- hdu 4006 The kth great number,set,priority_queue
- 6.HelloWorld之对EditText中的输入进行格式验证
- nike官方網 UHbq Hgw NF4Rm
- 笔试总结
- 紐巴倫專賣 5U26 cyg UCaa4
- Android 实现序列化:Parcelable和Serializable接口的用法
- 怎样用java编程抓取动态生成的网页
- iOS开发:block的探究(1)
- Android 图表绘制 achartengine 示例解析