Hdus 4006 the kth great number, set, priority_queue

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

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

 

Use set or priority_queue to maintain a sequence with a length of K from small to large, and the first element is required for each query.

#include <cstdio>#include <set>#include <map>#include <vector>#include <iostream>using namespace std;multiset<int> ms;int main(){    int n, k, x;    char ch[10];    while(~scanf("%d%d", &n, &k)) {        ms.clear();        while(n--) {            scanf("%s", ch);            if(ch[0]=='I') {                scanf("%d",&x);                ms.insert(x);                if(ms.size()>k) {                    ms.erase(ms.begin());                }            } else {                printf("%d\n", *ms.begin());            }        }    }    return 0;}

#include <cstdio>#include <set>#include <map>#include <vector>#include <queue>#include <iostream>using namespace std;priority_queue<int,vector<int>, greater<int> > pq;int main(){    int n, k, x;    char ch[10];    while(~scanf("%d%d", &n, &k)) {        while(!pq.empty()) pq.pop();        while(n--) {            scanf("%s", ch);            if(ch[0]=='I') {                scanf("%d",&x);                pq.push(x);                if(pq.size()>k) {                    pq.pop();                }            } else {                printf("%d\n", pq.top());            }        }    }    return 0;}

Hdus 4006 the kth great number, set, priority_queue