hdu 1509 优先队列

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
struct node{
char s[20];
int canshu;
int priority;
int num;
bool operator < (const node&b) const{
if(priority==b.priority)
return num>b.num;
return priority>b.priority;
}
};
int main()
{
int i,j,t;
char str[20];
priority_queue<node>Q;
//     scanf("%d",&t);
int tot=0;
while(scanf("%s",str)!=EOF)
{
if(strcmp(str,"GET")==0)
{
if(!Q.empty())
{printf("%s %d\n",Q.top().s,Q.top().canshu); Q.pop();}
else printf("EMPTY QUEUE!\n");

}
else
{
node tmp;
scanf("%s%d%d",tmp.s,&tmp.canshu,&tmp.priority);
tmp.num=++tot;
Q.push(tmp);
}
}
return 0;
}