HDU4006(小根堆)
2024-10-10 04:19:46
The kth great number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 9780 Accepted Submission(s): 3898
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
#include <cstdio>
#include <string.h>
#include <queue>
#include <vector>
using namespace std;
const int MAXN=;
int n,k;
int vis[MAXN];
int main()
{
while(scanf("%d%d",&n,&k)!=EOF)
{
memset(vis,,sizeof(vis));
priority_queue<int,vector<int>,greater<int> > que;
for(int i=;i<n;i++)
{
scanf("%*c");
char op;
scanf("%c",&op);
if(op=='I')
{
int x;
scanf("%d",&x);
if(!vis[x])
{
que.push(x);
}
if(que.size()>k)
{
int y=que.top();
vis[y]=;
que.pop();
}
}
else
{
int res=que.top();
printf("%d\n",res);
}
}
}
return ;
}
最新文章
- 初识CDQ分治
- (转)T-SQL查询处理执行顺序(一)
- jpa注解
- Linux之grep命令详解
- tldr 的安卓客户端
- 500 TypeError: Cannot read property &#39;connect.sid&#39; of undefined
- C# 语音识别(文字to语音、语音to文字)
- 开源框架DNN使用01
- 如何在linux中设置tab键长度
- 集成学习---bagging and boosting
- 【SQL】Oracle的PL/SQL语法及其拓展数据类型总结
- [Angular Tutorial] 7-XHRs &; Dependency Injection
- 用excel公式生成有规律的代码,减少编程工作量
- Algorithm -->; 阶乘和因子
- [HNOI 2001]产品加工
- postgresql清理工具
- 【题解】Luogu P2730 魔板
- 原生ajax写法
- 联系customer的js
- POJ2125 Destroying The Graph