The kth great number（优先队列）

最新推荐文章于 2018-07-28 11:38:51 发布

转载最新推荐文章于 2018-07-28 11:38:51 发布 · 387 阅读

数据结构专栏收录该内容

14 篇文章

订阅专栏

本文深入探讨了游戏开发领域的核心技术，包括游戏引擎、图形渲染、3D空间视频等关键概念及应用实例。

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

The kth great number

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 8115 Accepted Submission(s): 3214

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<cstdio>
#include<iostream>
#include<queue>
#include<vector>
#include<cstring>
using namespace std;
struct cmp
{
    bool operator()(int a,int b)
    {
        return a>b;//从小到大排列
    }
};
int main()
{
    int n,k,num;
    char c;
    priority_queue<int,vector<int>,cmp>Q;
    while(cin>>n>>k)
    {
        while(!Q.empty())
        {
            Q.pop();
        }//清空队列
        while(n--)
        {
           cin>>c;
           if(c=='I')
           {
               cin>>num;
               Q.push(num);
               while(Q.size()>k)
               {
                   Q.pop();
               }//保持队列的长度为K
           }
           else
           {
               cout<<Q.top()<<endl;
           }
        }
    }
}