HDOJ 题目4006 The kth great number(优先队列水)
来源:互联网 发布:2017安全网络竞赛答案 编辑:程序博客网 时间:2024/05/16 05:28
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 7100 Accepted Submission(s): 2904
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: 4007 4004 4008 4005 4001
ac代码
#include<stdio.h>#include<string.h>#include<queue>#include<string>#include<iostream>using namespace std;struct s{int x;friend operator < (s a,s b){return a.x>b.x;}}h;int main(){int n,m;while(scanf("%d%d",&n,&m)!=EOF){priority_queue<struct s>q;while(n--){char c;getchar();scanf("%c",&c);if(c=='I'){//struct s h;scanf("%d",&h.x);q.push(h);if(q.size()>m)q.pop();}elseprintf("%d\n",q.top().x);}}}
0 0
- HDOJ 题目4006 The kth great number(优先队列水)
- HDOJ 4006 - The kth great number 优先队列水
- HDOJ 4006 The kth great number(优先队列)
- hdoj 4006 The kth great number(优先队列)
- HDOJ 4006 The kth great number(优先队列)
- hdoj 4006 The kth great number【优先队列】
- HDOJ 4006 The kth great number(优先队列)
- HDOJ The kth great number (优先队列)
- The kth great number(优先队列)
- The kth great number(优先队列)
- 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(优先队列)
- 杭电4006 The kth great number(优先队列)
- HDU 4006 The kth great number (优先队列)
- 【HDU 4006】The kth great number(优先队列)
- [转载]STL:vector容器用法详解
- sortings in python
- Cocoa/Cocoa.h file not found
- innerText FF兼容性问题--摘抄
- iOS开发-xcode无法提交.a静态库文件的解决办法
- HDOJ 题目4006 The kth great number(优先队列水)
- java学习笔记,复习+总结(2)
- JS实现计时器(prototype)+表格排序
- iOS App分发
- Get Start StrangeIOC for Unity3D
- iOS系统安全机制概览
- 真机调试
- iOS内IPC-------------进程间通信
- 物联网 移动国家代码 以及 移动网络代码