The kth great number（HDU -4006）

最新推荐文章于 2022-01-20 23:21:07 发布

原创最新推荐文章于 2022-01-20 23:21:07 发布 · 517 阅读

0 ·

CC 4.0 BY-SA版权

STL 专栏收录该内容

8 篇文章

订阅专栏

在这款数字游戏中，小明可以写下数字或询问已写下的第k大的数字。任务是帮助小宝正确回答小明的问题。

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).

代码如下：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,k,m;
    char ord;
    while(cin>>n>>k)
    {
        priority_queue<int,vector<int>,greater<int> >a;
        for(int i=1;i<=n;i++)
        {
            cin>>ord;
            if(ord=='I')
            {
                cin>>m;
                a.push(m);
                if(a.size()>k)
                    a.pop();
            }
            else
                cout<<a.top()<<endl;
        }
    }
    return 0;
}