hdu 4006 优先队列
来源:互联网 发布:铁三角msr7煲机 知乎 编辑:程序博客网 时间:2024/05/21 21:41
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
#include <iostream>#include <cstdio>#include <algorithm>#include <queue>using namespace std;priority_queue<int,vector<int>,greater<int> > q;void init() { while(!q.empty()) q.pop();}int main() {// freopen("input.txt","r",stdin); int n,k; while(scanf("%d%d",&n,&k)!=EOF) { init(); char cmd[5]; int num; while(n--) { scanf("%s",cmd); if(cmd[0]=='I') { scanf("%d",&num); if(q.size()<k) q.push(num); else { if(q.top()<num) { q.pop(); q.push(num); } } } if(cmd[0]=='Q') { printf("%d\n",q.top()); } } } return 0;}
- hdu 4006 优先队列
- HDU 4006 优先队列
- HDU 4006优先队列
- hdu 4006 优先队列
- hdu 4006 (优先队列)
- HDU-1509 优先队列
- hdu 2757 优先队列
- hdu 1509 优先队列
- hdu 1873优先队列
- 【优先队列】HDU Rescue
- HDU 4546 优先队列
- hdu 5437 (优先队列)
- hdu-5596 优先队列
- hdu 4544 优先队列
- HDU 4302 优先队列
- HDU 5360 优先队列
- hdu 5810 优先队列
- hdu 5437优先队列
- zoj 2724 优先队列
- windows7 下安装64位oracle11g用PL/SQL Developer连接报错问题
- ANDROID NOTIFICATION 通知的使用
- editplus 快捷键
- Redis之Sentinel主从复制,读写分离,主从切换
- hdu 4006 优先队列
- Linux源码解析-信号机制相关数据结构
- 基础知识点巩固
- WKWebView 和本地代码交互方式
- 连续子数组的最大和
- Android 利用服务Service创建标题栏通知
- POJ 3370 Halloween treats(抽屉原理)
- ZOJ 2795 Ambiguous permutations 水~
- BAT及各大互联网公司前端笔试面试题--Html,Css篇(加上自我整理总结哟)