hdoj 1509 Windows Message Queue【优先队列】
2015-07-28 14:49
225 查看
Windows Message Queue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4352 Accepted Submission(s): 1726
[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!
#include<stdio.h> #include<string.h> #include<queue> using namespace std; struct node { char s[110]; int can; int first; int time; friend bool operator < (node a,node b) { if(a.first!=b.first) return a.first>b.first; else return a.time>b.time; } }; int main() { int n,m,j,i,t; char str[10],s1[110]; priority_queue<node>q; node x; int k=0; while(scanf("%s",str)!=EOF) { if(str[0]=='G') { if(q.empty()) { printf("EMPTY QUEUE!\n"); } else { x=q.top(); printf("%s %d\n",x.s,x.can); q.pop(); } } else { k++; scanf("%s %d %d",s1,&n,&m); strcpy(x.s,s1); x.can=n; x.first=m; x.time=k; q.push(x); } } return 0; }
相关文章推荐
- 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问题
- 232.Implement Queue using Stacks(用栈实现队列)
- android常用UI使用案例:DatePicker和TimerPicker
- android常用UI使用案例:Spinner
- [LeetCode] Unique Paths II
- Android API Guides 阅读笔记(5)----Loader
- Android Studio 1.3RC版 build加速
- duilib拖动控制功能的实现(源代码)
- iOS-UI-03 UITextField UIAlertView
- This File Does Not Exist At The Requested Revision
- android常用UI使用案例:AutoCompleteTextView
- 写在Demo战斗系统之前,先用原型工具做套UI第一篇-登录界面
- Codeforces Round #313 (Div. 2) D. Equivalent Strings(字符串+递归)