hdoj4006The kth great number[【优先队列】
来源:互联网 发布:淘宝客教程视频 编辑:程序博客网 时间:2024/06/01 07:37
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 8931 Accepted Submission(s): 3540
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
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<functional>using namespace std;const int maxn=1000010;int num[maxn];priority_queue<int,vector<int>,greater<int> >Q;int main(){int n,k,ans,num,a;char str[2];while(scanf("%d%d",&n,&k)!=EOF){while(!Q.empty())Q.pop();num=0;while(n--){scanf("%s",str);if(str[0]=='I'){scanf("%d",&a);num++;Q.push(a);if(num>k){Q.pop();}}else {printf("%d\n",Q.top());}}}return 0;}
0 0
- hdoj4006The kth great number[【优先队列】
- hdoj4006The kth great number
- HDU4006-The kth great number(优先队列)
- hdu_4006 The kth great number 优先队列
- The kth great number(优先队列)
- [优先队列] HDU4006 The kth great number
- HDU4006 The kth great number 优先队列
- 【优先队列】HDU4006The kth great number
- The kth great number 优先队列
- 优先队列 The kth great number
- hdu4006 The kth great number 优先队列
- HDU4006 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(优先队列、堆实现)
- HDOJ 4006 The kth great number(优先队列)
- 逆向总结(3)-- 无模块遍历API(找到Kernel32.dll)
- Java设计模式_结构型_适配器模式_丑小鸭与白天鹅
- 怕自己忘记<c:forEach varStatus="status">中 varStatus的作用
- CentOS7 安装MongoDB 3.0服务器
- C#中哈希表(HashTable)的用法详解
- hdoj4006The kth great number[【优先队列】
- 创建虚拟串口并通信
- hibernate第二篇 org.hibernate.HibernateException: Connection cannot be null when 'hibernate.dialect' no
- 使用 jdMind 及改进
- 控制台、终端、shell
- iOS开发零基础教程之真机调试流程
- javascript 从定义到执行
- UITableViewCell的accessoryType属性
- 不使用spring的aop功能实现日志输出