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): 8165 Accepted Submission(s): 3230

点击打开链接

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 

<span style="font-size:14px;">#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;

struct node
{
	int num; 
	friend bool operator < (node a,node b)
	{
	  return b.num<a.num;
	}
};

int main()
{
  int n,k;
  node pos,next;
  while(~scanf("%d%d",&n,&k))
  {
  	priority_queue<node>q;
  	int count=0;
  	while(n--)
  	{  
	  char opr;
	  getchar();
  	  scanf("%c",&opr);
	  
  	  if(opr=='I')
  	  {
  	    scanf("%d",&next.num);
  	    if(count<k)
		{ 
		 q.push(next);
		 count++;
		}
	   else//只保存前K大的数，后面不用管，如果从输出考虑那样的话算法的时间复杂度很大，容易超时
	    {
	     	pos=q.top();
	   	   if(pos.num<next.num)
	   	   {
	   	     q.pop();
		     q.push(next);	
		   }
	   }
	  }
	  else if(opr=='Q')
	   printf("%d\n",q.top().num);
	  
	}
  }
  return 0;	
}
/*最优解法，大神的代码*/
/*
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
using namespace std;
#define N 500005
priority_queue<int, vector<int>, greater<int> > Q;
int n, k;
main()
{
	int i, j, x;
	char s[5];
	while(scanf("%d %d",&n,&k)==2){
		while(!Q.empty()) Q.pop();
		while(n--){
			scanf("%s",s);
			if(s[0]=='I'){
				scanf("%d",&x);
				if(Q.size()<k) Q.push(x);
				else if(Q.top()<x){
					Q.pop();Q.push(x);
				}
			}
			else printf("%d\n",Q.top());
		}
		
	}
}
*/
 </span>