哈理工OJ - 1248-The kth great number 【优先队列】

原创于 2018-02-21 20:40:34 发布 · 201 阅读

0 ·

CC 4.0 BY-SA版权

STL 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一个简单的数字游戏实现方案，使用优先队列来维护玩家询问的第k大的数。通过不断插入新数并保持队列大小不超过k，确保始终能快速响应玩家的询问。

HRBUST - 1248-The kth great number 【优先队列】
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<stdio.h>
#include<string.h>
#include<iostream>
#include<vector>
#include<queue>
using namespace std;

int main()
{
    int n,k,x;
    char s[5];
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        priority_queue<int ,vector<int>,greater<int> >q;//优先队列
       for(int i=1;i<=n;i++)
        {
            scanf("%s",s);
            if(s[0]=='I')
            {
                scanf("%d",&x);
                q.push(x);
                if(q.size()>k)
                    q.pop();
            }
            else
            {
                printf("%d\n",q.top());
            }
        }
    }
    return 0;
}