HDU 4006 The kth great number(优先队列·第K大数)
来源:互联网 发布:tensorflow如何入门 编辑:程序博客网 时间:2024/06/05 00:52
题意 动态查询第K大的数
用小数在前优先队列维护K个数 每要插入一个数时 若这个数小于队首元素那么就不用插入了 否则队首元素出队 这个数入队 每次询问只用输出队首元素就行了
#include<cstdio>#include<queue>using namespace std;int main(){ int n, a, k; char op[5]; while(~scanf("%d%d", &n, &k)) { priority_queue<int,vector<int>,greater<int> > pq; while(n--) { scanf("%s", op); if(op[0] == 'I') { scanf("%d",&a); if(pq.size()<k) pq.push(a); else if(a > pq.top()) pq.push(a),pq.pop(); } else printf("%d\n", pq.top()); } } return 0;}
The kth great number
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).
1 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(优先队列)
- C++18题
- Exchange2010日志过大解决方案
- SqlServer 可更新订阅中在订阅库并发获取最大单据号死锁测试及解决法案!
- C++第十七题
- python 采集相关
- HDU 4006 The kth great number(优先队列·第K大数)
- eclipse启动tomcat无法访问
- Android设计模式之MVC模式
- C++第十五题
- 通过httpd.conf来优化大数据访问 - sever 2008 Apache优化配置
- Blast2GO使用方法详解(命令界面)
- 第一章
- json解析
- 最短路径比较