HDOJ 4006 The kth great number

The kth great number

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

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

 

Source

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

 

Recommend

lcy

 

这个题了解优先队列到底怎么回事！

咳……其实之前一直迷迷糊糊的，这个题一下让我理解了。

如果画个图会更清楚，有时间了再补图，具体看代码和注释吧。给自己留个存档。

OTZ以及重载暂时只会用结构体的，看起来很蠢。

题解：本题大概思路就是只在队列里留K个数，多了就出队。

#include<stdio.h>
#include<string.h>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
struct Num
{
	int x;
	bool friend operator <(Num a,Num b)
	{
		return a.x>b.x;
	} 
}a,temp;
char ch[3];
int main()
{
	int n,k;
	while(~scanf("%d%d",&n,&k))
	{
		priority_queue<Num> q;
		while(n--)
		{
			scanf("%s",&ch);
			if(ch[0]=='Q')
			{
				if(q.size()<k)
					continue;
				else
				{
					temp=q.top();//最上面是最后面的，也是最大的！！（我终于明白了！！ 
					printf("%d\n",temp.x);
				}
			}
			else
			{
				scanf("%d",&a.x);
				q.push(a);
				if(q.size()>k)
					q.pop();//最前面是最小的，把最前面的出队 
			}
		}
	}
	return 0;
}