蓝桥杯练习【STL训练】——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.

输入：

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.

输出：

The output consists of one integer representing the largest number of islands that all lie on one line.

样例输入：

8 3
I 1
I 2
I 3
Q
I 5
Q
I 4
Q

样例输出：

1
2
3

解题思路：

使用优先级队列小根堆，始终保持队列里面是当前最大的k个数。

参考代码：

#include<bits/stdc++.h>

using namespace std;

priority_queue<int, vector<int>, greater<int> >a;

int main () {
  char ch;
  int n,k;
  while (~scanf("%d%d",&n,&k)) {
    while (!a.empty())
        a.pop();
    while (n--) {
      int num;
      getchar();
      scanf("%c", &ch);
      if (ch == 'I') {
        scanf("%d",&num);
        a.push(num);
        if(a.size()>k)
        a.pop();
      }else {
        num = a.top();
        printf("%d\n",num);
      }
    }
  }
  return 0;
}