HDU - 4006 The kth great number （set&数据结构）

135人阅读 评论(0)

HDU - 4006
 Time Limit:                                                        1000MS Memory Limit: 65768KB 64bit IO Format:                            %I64d & %I64u

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


Source

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

//思路：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<set>
#define INF 0x3f3f3f3f
#define N 1000010
using namespace std;
char s[2];
struct zz
{
int x;
friend bool operator < (zz a,zz b)
{
return a.x>b.x;
}
}p;
multiset<zz>st;
multiset<zz>::iterator f;
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
st.clear();
for(int i=0;i<n;i++)
{
scanf("%s",s);
if(s[0]=='I')
{
scanf("%d",&p.x);
st.insert(p);
f=st.end();
f--;
if(st.size()>m)
st.erase(f);
}
else
{
f=st.end();
f--;
printf("%d\n",*f);
}
}
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：275303次
• 积分：13450
• 等级：
• 排名：第1022名
• 原创：1116篇
• 转载：20篇
• 译文：0篇
• 评论：23条
阅读排行
最新评论