The kth great number

最新推荐文章于 2019-03-13 23:43:34 发布

原创最新推荐文章于 2019-03-13 23:43:34 发布 · 369 阅读

0 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

11 篇文章

订阅专栏

XiaoMing和XiaoBao进行了一场数字游戏，XiaoMing可以选择写数字或者询问XiaoBao第k大的数字。此问题通过优先队列解决，帮助XiaoBao找出所需数字。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

[hint]Xiao  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).[ hint]< div>

Source

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest

本题应先考虑到优先队列，因为输入字符过于频繁，而且是求第几大的数，所以可以用队列来找出这个数，n表示这个过程持续多少步，而k是表示第几大，以下是我写的代码。

#include<stdio.h>
#include<queue>
using namespace std;
int n,k,i,a;
char c;
int main()
{
while(scanf("%d%d",&n,&k)!=EOF)
{
priority_queue<int,vector<int>,greater<int> >q;//队列清零
for(i=0;i<n;i++)
{
getchar();
scanf("%c",&c);
if(c=='I')
{
scanf("%d",&a);//考虑输入字母是‘I’的这种情况
q.push(a);
}

else if(c=='Q')//考虑‘Q’的这种情况
printf("%d\n",q.top());
if(q.size()>k)
q.pop();

}
}
return 0;
}