Windows Message Queue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4341 Accepted Submission(s): 1719
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!
题意:让你写一个处理信息的队列。当输入指令GET时,输出队列头部的信息以及它的参数。输入PUT时,意味着要把该信息以及参数存入队列。
遵循原则:每条信息都有相应的优先级,按照优先级从大到小排列,若优先级相同,按存入队列先后排列。
裸STL priority_queue
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <algorithm>
#define MAXN 1000+10
using namespace std;
struct Node
{
char msg[MAXN];
char num[MAXN];
int KK;//判断优先级
int pos;//出现先后
friend bool operator < (Node a, Node b)
{
if(a.KK != b.KK)
return a.KK > b.KK;
else
return a.pos > b.pos;
}
};
int main()
{
char op[MAXN];
char MM[MAXN];
char NN[MAXN];
int H;
priority_queue<Node> Q;
int note = 1;//记录顺序
while(scanf("%s", op) != EOF)
{
switch(op[0])
{
case 'G':
if(Q.empty())//空
printf("EMPTY QUEUE!\n");
else
{
Node E = Q.top(); Q.pop();
printf("%s %s\n", E.msg, E.num);
}
break;
case 'P':
scanf("%s%s%d", MM, NN, &H);
Node E;
strcpy(E.msg, MM), strcpy(E.num, NN);
E.KK = H; E.pos = note++;
Q.push(E);
}
}
return 0;
}