Hdu 4006 The kth great number (第k大元素 优先队列的几种写法)

#include<cstdio>
#include<queue>
using namespace std;

struct Node
{
	int data;
	bool operator < (const Node b) const
	{
		return data>b.data;
	}
}node;
//重载 “()” 操作符
struct myComp
{
    bool operator () (const int a,const int b)
    {
        return a>b;
    }
};

int main ()
{
	int n,k,num;
    char str[4];
	while (~scanf("%d%d",&n,&k))
	{
		priority_queue<Node> Q;
		//priority_queue<int,vector<int>,greater<int> > Q;
		//priority_queue<int,vector<int>,myComp > Q;

		for (int i=1;i<=n;i++)
		{
			scanf("%s",str);
			if (str[0]=='I')
			{
			    //scanf("%d",&num);
			    scanf("%d",&node.data);
				Q.push(node);
				if (Q.size()>k)
					Q.pop();
			}
			else
				printf("%d\n",Q.top());
		}
	}
	return 0;
}