用stl可以解决。。题目：

The kth great number

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

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

ac代码：

#include <iostream>
#include <string.h>
#include <algorithm>
#include <set>
#include <cstdio>
using namespace std;
int main(){
//freopen("11.txt","r",stdin);
int n,k;
char ch;
while(~scanf("%d%d",&n,&k)){
int x;
multiset<int> ss;
while(n--){
cin>>ch;
if(ch=='I'){
scanf("%d",&x);
ss.insert(x);
if(ss.size()>k)
ss.erase(ss.begin());
}
else{
printf("%d\n",*ss.begin());
}
}
}
return 0;
}

The kth great number(优先队列)

2017-07-18 14:15:44

HDU 4006 The kth great number （基本算法-水题）

2014-08-03 22:07:47

杭电 4006 亚洲区预赛大连赛区

2011-09-04 17:18:22

The kth great number

2014-03-13 14:12:28

【HDU 4006】The kth great number（优先队列）

2016-07-18 16:05:58

The kth great number - set

2018-02-11 22:56:53

hdoj-4006-The kth great number

2016-06-07 09:20:37

hduoj~The kth great number~﻿﻿﻿﻿优先队列

2015-07-29 10:25:05

HDOJ-----4006优先队列

2016-07-26 02:04:50

lintCode. 792 Kth Prime Number

2018-02-28 23:41:53