模拟窗口消息队列

Description

Message queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something happens to this process, such as mouse click, text change, the system will add a message to the queue.Meanwhile, the process will do a loop for getting message from the queue according to the priority value if it is not empty. Note that the less priority value means the higher priority.In this problem, you are asked to simulate the message queue for putting messages to and getting message from the message queue.

Input

There's only one test case in the input. Each line is a command, "GET" or "PUT", which means getting message or putting message. If the command is "PUT", there're one string means the message name and two integer means the parameter and priority followed by. There will be at most 60000 command. Note that one message can appear twice or more and if two messages have the same priority, the one comes first will be processed first.(i.e., FIFO for the same priority.) Process to the end-of-file.

Output

For each "GET" command, output the command getting from the message queue with the name and parameter in one line. If there's no message in the queue, output "EMPTY QUEUE!". There's no output for "PUT" command.

Sample Input

 
 

  
  GET
PUT msg1 10 5
PUT msg2 10 4
GET
GET
GET
 
 

Sample Output

 
 

  
  EMPTY QUEUE!
msg2 10
msg1 10
EMPTY QUEUE!
 
 

===============================================


算法：（主要是优先队列的用法：

1.输入命令；

2.判断是GET还是PUT

3.若是PUT，则输入str，par,pri，按pri大小升序，若pri相同，则根据接受的先后顺序（计数），

存入优先队列

4.若是GET，则判断优先队列中是否数据

                   a.优先队列不为空：输出最底端数据的str和par （先进先出

                   b.优先队列为空，输出空。

5.返回1，直到不再输入命令

====================================

#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;

struct node
{
	char str[100];
	int a, b, t;
	friend bool operator <(node x, node y)
	{
		if (x.b != y.b) return x.b > y.b;
		return x.t > y.t;
	}
};
node p;
priority_queue<node> s;

int main()
{
	char com[10];
	int a, b, count = 0;
	while (~scanf("%s", com))
	{
		if (strcmp(com,"GET")==0)
		{
			if (!s.empty())
			{
				printf("%s %d\n", s.top().str,s.top().a);
				s.pop();
			}
			else printf("EMPTY QUEUE!\n");

		}
		else
		{
			scanf("%s %d%d", p.str, &p.a, &p.b);
			p.t = ++count;
			s.push(p);
		}
	}
	return 0;
}