标签：
Windows Message QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4400 Accepted Submission(s): 1747 Problem 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!
|
题解：优先队列，要考虑同一优先级时的出列顺序；由于优先队列当优先级相同时随机输出队列，所以加一个z；否则wa；
代码：
1 #include<stdio.h> 2 #include<string.h> 3 #include<queue> 4 using namespace std; 5 const int MAXN=60010; 6 struct Node{ 7 char ms[20]; 8 int x,y,z; 9 friend bool operator < (Node a,Node b){ 10 if(a.y!=b.y)return a.y > b.y; 11 else return a.z>b.z; 12 } 13 }; 14 Node people; 15 int main(){int k=0; 16 char temp[5];priority_queue<Node>message; 17 while(memset(temp,0,sizeof(temp)),scanf("%s",temp)!=EOF){ 18 if(!strcmp(temp,"GET")){ 19 if(message.empty())puts("EMPTY QUEUE!"); 20 else printf("%s %d\n",message.top().ms,message.top().x),message.pop(); 21 } 22 else if(!strcmp(temp,"PUT"))k++,scanf("%s %d %d",people.ms,&people.x,&people.y),people.z=k,message.push(people); 23 } 24 return 0; 25 }
标签：
原文地址：http://www.cnblogs.com/handsomecui/p/4683559.html
