HDOJ 1509 Windows Message Queue (简单优先队列 )
2015-07-28 15:16
489 查看
Windows Message Queue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4360 Accepted Submission(s): 1728
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
GET
PUT msg1 10 5
PUT msg2 10 4
GET
GET
GET
[align=left]Sample Output[/align]
EMPTY QUEUE!
msg2 10
msg1 10
EMPTY QUEUE!
ac代码:
#include<stdio.h> #include<string.h> #include<queue> #include<iostream> #include<algorithm> using namespace std; struct s { char c[101]; int x; int y; int n; bool friend operator<(s a,s b) { if(a.y==b.y)//如果优先级相同,就谁先进去谁先出来,所以定义一个n作为顺序 return a.n>b.n; else return a.y>b.y; } }; int main() { char str[10]; priority_queue<s>q;//把队列定义在外面会TLE int num=0; s d; while(scanf("%s",str)!=EOF) { if(strcmp(str,"PUT")==0) { scanf("%s %d %d\n",d.c,&d.x,&d.y); d.n=++num; q.push(d); } else { if(!q.empty()) { d=q.top(); printf("%s %d\n",d.c,d.x); q.pop(); } else printf("EMPTY QUEUE!\n"); } } return 0; }
相关文章推荐
- 225.Implement Stack using Queues (用队列实现栈)
- iOS总结控件三(UItextField)
- 在 UITabBarController 和 UINavigationController tableView被navigati
- iOS阶段学习第26天笔记(UILabel的介绍)
- Fragment 中嵌套Fragment,更新数据,UI
- leetcode 063 —— Unique Paths II
- UVA 540 Team Queue
- UIBarButtonItem类目-返回一个有图片的导航栏按钮
- IOS8 UITableViewCell线填充方法 不显示多余cell分割线
- HDU 1509 Windows Message Queue
- RegQueryValueEx函数不能获取到键值?
- hdoj 1509 Windows Message Queue【优先队列】
- android常用UI使用案例:ImageSwitcher和Gallery
- 【kmp】hdu1171 Number Sequence
- leetcode 062 —— Unique Paths
- android常用UI使用案例:SeekBar
- FineUI初学手册-部分JS整理
- UITableiView
- hdoj 1509 Windows Message Queue 【STL 优先队列】
- UICollectionView中cell的border问题