hdu 4006 The kth great number(优先队列)
来源:互联网 发布:opengl游戏编程 pdf 编辑:程序博客网 时间:2024/05/22 05:31
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4006点击打开链接
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 11366 Accepted Submission(s): 4508
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).
优先队列维护个size为k的最大堆
#include <iostream>#include <stdio.h>#include <limits.h>#include <stack>#include <algorithm>#include <queue>using namespace std;char c;int main(){ long long int n=0; long long int k=0; while(~scanf("%lld%lld",&n,&k)) { priority_queue <long long int ,vector <long long int >, greater<long long int > > q ; getchar(); for(long long int i=0;i<n;i++) { scanf("%c",&c); getchar(); if(c=='I') { long long int mid; scanf("%lld",&mid); getchar(); if(q.size()<k) { q.push(mid); } else { if(q.top()<mid) { q.pop(); q.push(mid); } } } else if(c=='Q') { printf("%lld\n",q.top()); } } }}
阅读全文
0 0
- 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(优先队列)
- 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(优先队列)
- led字符驱动程序
- JavaScript DOM编程艺术之js语法
- highcharts饼状图数据库动态数据显示
- 单链表面试题
- ros源码分析(5)—rosmaster xmlrpc api
- hdu 4006 The kth great number(优先队列)
- linux命令学习笔记二
- LINUX 进 程 控 制
- 简单介绍为甚么要用Hibernate?
- 定时任务调度之Timer
- java poi 导入Excel
- Java获取当前类名、方法名
- tensorflow卷积网络测试
- Sublime Text使用笔记