杭电4006 The kth great number(优先队列)
来源:互联网 发布:淘宝货源只有阿里巴巴 编辑:程序博客网 时间:2024/05/16 05:19
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 9036 Accepted Submission(s): 3579
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:4003 4007 4004 4008 4005
#include<stdio.h>#include<string.h>#include<queue>using namespace std;int main(){int n,k,a;char str[3];while(~scanf("%d%d",&n,&k)){priority_queue<int,vector<int>,greater<int> >q;\\从小到大排列while(n--){scanf("%s",str);if(strcmp(str,"I")==0){scanf("%d",&a);q.push(a);if(q.size()>k)q.pop();}elseprintf("%d\n",q.top());}}return 0;}
0 0
- 杭电4006 The kth great number(优先队列)
- 杭电 4006 The kth great number(优先队列)
- 杭电-4006 The kth great number(优先队列)
- hdu杭电4006 The kth great number【优先队列】
- The kth great number(优先队列)
- The kth great number(优先队列)
- The kth great number(优先队列)
- HDOJ 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(优先队列)
- Codeforces Round #338 (Div. 2) B. Longtail Hedgehog
- POJ 1466 Girls and Boys(二分图最大独立集)
- Android中四种对话框案例
- vsftp 安装 配置
- PHP基础语法总结(一)
- 杭电4006 The kth great number(优先队列)
- linux硬链接和软链接的区别
- POJ 2104 K-th Number
- nefuoj-813:good
- POJ3628 01背包
- C 语言资源大全中文版
- Codeforces Round #338 (Div. 2) C. Running Track
- C++中引用和指针的区别
- html转pdf,jsf实现下载功能