標籤:sam proc ext roc change span cin something node
Windows Message Queue |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 85 Accepted Submission(s): 53 |
|
Problem DescriptionMessage 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. |
InputThere‘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. |
OutputFor 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 InputGETPUT msg1 10 5PUT msg2 10 4GETGETGET |
Sample OutputEMPTY QUEUE!msg2 10msg1 10EMPTY QUEUE! |
AuthorZHOU, Ran |
SourceZhejiang University Local Contest 2006, Preliminary |
Recommendlinle |
/*題意:簡單的類比兩個操作:GET擷取優先順序最高的,PUT壓進棧東西初步思路:優先隊列,搞一下,本來想偷一下懶。把以前寫的代碼貼上,結果死活不對。*/#include<bits/stdc++.h>using namespace std;struct node{ string name; int val; int Rank; int time; node(){} node(string a,int b,int c,int d){ name=a; val=b; Rank=c; time=d; } bool operator < (const node &other) const{ if(Rank==other.Rank) return time>other.time; return Rank>other.Rank; }};priority_queue<node> Message;string op;string name;int times=0;int val,Rank;void init(){ times=0; while(!Message.empty()) Message.pop();}int main(){ // freopen("in.txt","r",stdin); init(); while(cin>>op){ if(op=="GET"){ if(Message.empty()) puts("EMPTY QUEUE!"); else{ cout<<Message.top().name<<" "<<Message.top().val<<endl; Message.pop(); } }else{ cin>>name>>val>>Rank; Message.push(node(name,val,Rank,times++)); } } return 0;}
Windows Message Queue