The 36th ACM/ICPC Asia Regional Dalian Site 1004 The kth great number

The kth great number

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65768/65768K (Java/Other)

Total Submission(s) : 9   Accepted Submission(s) : 5

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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 3I 1I 2I 3QI 5QI 4Q

Sample Output

123

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

Source

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

总结：

题目很简单，我们只要维护一个大小为k，并且含有前k大元素的优先队列即可

////  main.cpp//  The kth great number////  Created by 张嘉韬 on 16/9/16.//  Copyright © 2016年 张嘉韬. All rights reserved.//#include <iostream>#include <cstring>#include <algorithm>#include <queue>using namespace std;int main(int argc, const char * argv[]) {    //freopen("/Users/zhangjiatao/Documents/ACM/input.txt","r",stdin);    int n,k;    while(scanf("%d%d",&n,&k)!=EOF)    {        priority_queue <int> q;        for(int i=1;i<=n;i++)        {            char c;            cin>>c;            if(c=='I')            {                int num;                scanf("%d\n",&num);                num=num*-1;                q.push(num);                if(q.size()>k) q.pop();            }            else            {                printf("%d\n",-1*q.top());            }        }    }    return 0;}