hdu 杭电1509 Windows Message Queue【优先队列】
来源:互联网 发布:eu域名注册 编辑:程序博客网 时间:2024/05/16 14:58
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
GETPUT msg1 10 5PUT msg2 10 4GETGETGET
Sample Output
EMPTY QUEUE!msg2 10msg1 10EMPTY QUEUE!
#include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;struct message{char name[110];int pri;int data;int num;friend bool operator < (message a,message b)//重新定义队列顺序 {if(a.pri==b.pri) return a.num>b.num;return a.pri>b.pri;}};priority_queue<message>q;//定义优先队列 message temp;int main(){char s[110];int i=0;while(~scanf("%s",s)){if(strcmp(s,"GET")==0){if(!q.empty()){printf("%s %d\n",q.top().name,q.top().data);q.pop();}else{printf("EMPTY QUEUE!\n");}}else{scanf("%s %d %d",temp.name,&temp.data,&temp.pri);temp.num=++i;//把每个数据的序号保存,数据小的先输出 q.push(temp);}}return 0;}
0 0
- hdu 杭电1509 Windows Message Queue【优先队列】
- 【杭电oj】1509 - Windows Message Queue(优先队列)
- 【杭电-oj】-1509-Windows Message Queue(优先队列)
- 【杭电OJ】1509--Windows Message Queue(优先队列)
- hdu 1509 Windows Message Queue 优先队列
- hdu 1509 Windows Message Queue(优先队列)
- HDU-1509-Windows Message Queue(优先队列)
- HDU 1509 Windows Message Queue 【优先队列】
- hdu-1509 Windows Message Queue(优先队列)
- HDU 1509:Windows Message Queue【优先队列】
- HDU 1509 Windows Message Queue(优先队列)
- Windows Message Queue(杭电oj1509)(优先队列)
- ZOJ 2724/HDU 1509 Windows Message Queue(优先队列)
- hdu 1509 Windows Message Queue(优先队列)
- HDU 1509 -- Windows Message Queue(优先队列)
- HDU 1509 Windows Message Queue(优先队列)
- HDU 1509 Windows Message Queue(优先队列)
- hdu 1509 Windows Message Queue (优先队列)
- 【重要】安卓微信闪退,非清空数据法解决,不破坏聊天记录【完善中】
- 用 Windows API “GetAdaptersInfo” 获取 MAC 时遇到的问题
- 【C/C++学院】0814-引用高级、引用高级增加/auto自动变量自动根据类型创建数据/Bool/Enum/newdelete全局/大数据乘法与结构体/函数模板与auto/宽字符本地化/inline
- windows-电脑及软件相关一些快捷键
- Spring MVC学习-----------对Action做JUnit单元测试
- hdu 杭电1509 Windows Message Queue【优先队列】
- OSX工具集之——Theos
- linux 修改文件内容 vi命令
- Android闪屏问题如何Debug
- openflow详解
- 为什么我们应该为Ruby2.0的GC感到excited!
- poj2409--Let it Bead(置换群+polya奇数)
- iOS Layer动画的KeyPath
- Poj -2586 Y2K Accounting Bug--枚举