HDU 4006 The kth great number (优先队列)
2016-05-18 13:32
344 查看
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 9361 Accepted Submission(s): 3727
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 3 I 1 I 2 I 3 Q I 5 Q I 4 Q
Sample Output
1 2 3 大体题意:给你n个操作和一个数值k每一个操作可以插入一个数,也可以查询在已经插入的数中第K大的是多少! 思路:优先队列模拟,优先队列按小数优先!优先队列只存K个数当插入一个数后,发现大小大于K了 ,则pop()#include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<vector> using namespace std; struct cmp{ bool operator() (int &a,int &b){ return a > b; } }; priority_queue<int,vector<int>,cmp>q; int main(){ int n,k; while(scanf("%d%d",&n,&k) == 2){ while(!q.empty())q.pop(); int deep = 0; while(n--){ char s[5]; scanf("%s",s); if (s[0] == 'I'){ int v; scanf("%d",&v); q.push(v); ++deep; if (deep > k)q.pop(),--deep; } else printf("%d\n",q.top()); } } return 0; }
相关文章推荐
- acm 2016/5/18 hpu15级练习 A
- 开源项目——小Q聊天机器人V1.3
- Ajax初学体会
- PHP常用函数之-数组
- 数据映射--B树
- 彭界博-飞机游戏
- Struts1、Struts2、Hibernate、Spring框架工作原理介绍
- 实战3--设计管理模块, 第5步,实体设计技巧
- java.lang.IllegalArgumentException: You must not call setTag() on a view Glide is targeting
- 存储过程
- java 监控文件夹变化(钩子文件)
- select(poll)实现代码实现分析(基于kernel 3.10.0)
- android 微博sdk 集成 文件不存在(8998) 您所访问的站点在新浪微博的认证失败,错误码 21322
- 系统提示缺少libltdl.so.3
- Node.js中的setImmediate()与process.nextTick
- Github的repositories的文件大小限制
- BP神经网络设计常用的基本方法和实用技术
- 软件设计原则--单一职责原则
- Java EE中事务处理
- jQuery cookie操作