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.
GET PUT msg1 10 5 PUT msg2 10 4 GET GET GET
EMPTY QUEUE! msg2 10 msg1 10 EMPTY QUEUE!这个题和看病要排队那个挺像的 用优先级队列 只不过多了个参数 有相同信息的话也没关系啊符合先进先出
#include <iostream>
#include <iostream>#include <cstdio>
#include <string.h>
#include <queue>
#include <stack>
using namespace std;
struct node
{
int rank,num,tmp;
char str[100];
friend bool operator<(node a,node b)
{
if(a.rank==b.rank)return a.num>b.num;
return a.rank>b.rank;
}
};
int main()
{
char a[10];
priority_queue<node>q;
int i=1;
while(scanf("%s",a)!=-1)
{
node s;
if(a[0]=='G')
{
if(q.empty())
printf("EMPTY QUEUE!\n");
else
{
s=q.top();
q.pop();
printf("%s %d\n",s.str,s.tmp);
}
}
else
{
char b[100];
int x,y;
scanf("%s%d%d",b,&x,&y);
s.num=i++;
s.tmp=x;
s.rank=y;
strcpy(s.str,b);
q.push(s);
}
}
return 0;
}