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.
InputGET PUT msg1 10 5 PUT msg2 10 4 GET GET GET
EMPTY QUEUE! msg2 10 msg1 10 EMPTY QUEUE!
思路:模拟+优先队列,熟记格式,详见代码;
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
struct node
{
char s[100];
int a,b,c;//s代表指令字符串,a代表 指令,b代表指令等级,c代表前后顺序;
friend bool operator<(node x,node y)//优先队列格式,类似于sort排序;
{
if(x.b!=y.b)
return x.b>y.b;
else return x.c>y.c;
}
}q;//也可以在主函数内:node q;
int main()
{
char v[100];
int k=0;
priority_queue<node> Q;//优先队列格式;
while(scanf("%s",v)!=EOF)
{
if(!strcmp(v,"PUT"))
{ // 记住格式,套用;
scanf("%s %d %d",q.s,&q.a,&q.b);
q.c=++k;
Q.push(q);
}
else
{
if(Q.empty())
printf("EMPTY QUEUE!\n");
else
{ //记住格式,套用;
q=Q.top();
Q.pop();
printf("%s %d\n",q.s,q.a);
}
}
}
return 0;
}