zju2724 优先队列

#include<iostream>#include<queue>#include<string>using namespace std;struct Info{ char name[100]; int value; int time; bool operator < (const Info &a) const { return a.time<time;//按照time从小到大排列 } };int main(int argc,char* argv[] ){ priority_queue<Info> pq;//定义 Info类型的优先队列 Info info; char camd[100]; while(gets(camd)) { if(strcmp(camd,"GET")==0) { if(pq.empty()) {printf("EMPTY QUEUE!/n"); continue;} printf("%s %d/n",pq.top().name,pq.top().value); pq.pop(); } else { char mid[20]; sscanf(camd,"%s %s %d %d",mid,info.name,&info.value,&info.time);//从PUT msg1 10 5 中取出msg1 10 5分别给 info.name info.value info.time pq.push(info); } } return 0;}

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1724