hdoj 4006 The kth great number 【栈】
来源:互联网 发布:js离开当前页面事件 编辑:程序博客网 时间:2024/06/05 18:20
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 9961 Accepted Submission(s): 3969
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).
开始想着从大到小,先K+大的数出栈,输出K大数,再把出栈的数进栈,如果k很大那不就抓瞎了,
》》脑子灵一点儿
代码:
#include<cstdio>#include<cstring>#include<queue>using namespace std;int main(){int n,k,a,b,c;char str[10];while(~scanf("%d%d",&n,&k)){priority_queue<int,vector<int>,greater<int> > que;for(int i=0;i<n;i++){scanf("%s",str);if(strcmp(str,"I")==0){getchar();scanf("%d",&a);que.push(a); if(que.size()>k)//只保留k个最大的数,前面小的数都出栈 que.pop();}else{printf("%d\n",que.top());} } }return 0;}
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 4006The kth great number(优先级队列)
- HDOJ 4006The 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(优先队列)
- The kth great number
- The kth great number
- The kth great number
- Java工程师面试考纲
- WeX5
- HDU 5747 Aaronson (lower_bound函数)
- 【Codeforces Round 364 (Div 2)E】【树上路径 贪心】Connecting Universities 树上2k个点配对使得路径之和尽可能大
- Linux下C语言开发(进程控制—fork()、exec函数族)
- hdoj 4006 The kth great number 【栈】
- Android之动态引导页
- 员工怎样跟老板谈加薪 7个技巧让你成功加薪
- E - V
- 八皇后
- 【Codeforces Round 364 (Div 2)F】【暴力 双连通分量求桥】Break Up n点m边最多割2边最小成本使得S与T不联通
- JavaScript中的this
- Java中的继承
- [Cloud Computing]Mechanisms: Storage Path Masking