1007(优先队列)
来源:互联网 发布:跨运营商之间网络不通 编辑:程序博客网 时间:2024/06/06 09:18
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
123
题目大概:
要求我们求出所给数列的第k大数。
思路:
刚开始,我是用树状数组做的,再加上二分,但是超时了。
因为用二分必须要有序,所以我用了排序,我感觉就是排序超时,但没找到解决的好办法,就用了这个优先队列,毕竟看到这个题,很少有人会想到树状数组。
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;struct poin{ int v; friend bool operator<(poin a,poin b) { return a.v>b.v; }};int main(){ int n,k;int l; poin s; while(~scanf("%d%d",&n,&k)) { priority_queue<poin>q; char p[2]; while(n--) { scanf("%s",p); if(p[0]=='I') { scanf("%d",&l); s.v=l; q.push(s); int t=q.size(); if(t>k)q.pop(); } else { poin su=q.top(); printf("%d\n",su.v); } } } return 0;}
阅读全文
0 0
- 1007(优先队列)
- 左式堆(优先队列)
- 优先队列(堆)
- hdu4006(优先队列)
- 优先队列(priority_queue)
- 优先队列(堆)
- hdu3873 (优先队列)
- priority_queue(优先队列)
- 优先队列(堆)
- UVA1203Argus(优先队列)
- 优先队列(二)
- Stones(优先队列)
- priority_queue(优先队列)
- 优先队列(堆)
- 优先队列(堆)
- 优先队列 (2)
- 优先队列(priority_queue)
- (java)优先队列
- .NET Core 2.0 开源Office组件 NPOI
- JIRA 7.2.2破解版 服务端安装
- android HDMI (一):HDMI基础篇
- Codeforces AIM Tech Round 3 (Div. 2)(A-D 未完)
- 利用htmlunit——WebClient实现的java爬虫程序
- 1007(优先队列)
- 图片的放大缩小
- Unity入门操作_射线_016
- phpqrcode 生成图片显示出错
- PAT basic 1051
- 多布局的自定义Adapter
- 字符串问题---0左边必有1的二进制字符串数量
- HDU 2298 Toxophily(公式推导)
- HDU 6166 Senior Pan(二进制划分集合)