Windows Message Queue

Source: Internet
Author: User

Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)

Total submission (s): 4440 Accepted Submission (s): 1766


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 would add a message to the queue. Meanwhile, the process would do a loop for getting message from the queue according to the priority value if it's not empt Y. Note the less priority value means the higher priority. In this problem, you is 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 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 both integer means the parameter and priority Follo Wed by. There'll is at the most 60000 command. Note that one message can appear twice or more and if the messages has the same priority, the one comes first would be pro Cessed first. (i.e., FIFO for the same priority.) Process to the End-of-file.
Outputfor each "GET" command, the output of the command getting from the message queue with the name and parameter on one line. If There's no message in the queue, output "EMPTY queue!". There ' s no output for "PUT" command.
Sample Input
Getput MSG1 5PUT msg2 4GETGETGET

Sample Output
EMPTY queue!msg2 10MSG1 10EMPTY queue!

At first did not consider if the priority is equal, to output this situation in order of input;

#include <stdio.h> #include <queue>using namespace std;struct stu{char name[20];int num;int number;int ID; friend bool operator< (stu X,stu y) {if (X.number==y.number) return X.id>y.id;return x.number>y.number;}}; int main () {char a[50];struct stu b;int c=0;//priority_queue<int,vector<int>,greater<int> >q; Priority_queue<stu> Q;while (scanf ("%s", a)!=eof) {if (a[0]== ' G ') {if (Q.empty ()) {printf ("Empty queue!\n");} else {b=q.top ();p rintf ("%s%d\n", b.name,b.num); Q.pop ();}} ELSE{SCANF ("%s%d%d", B.name,&b.num,&b.number);//q.push (b.number);//b.number=c;b.id=++c;//Mark Input Order Q.push ( b);}} return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Windows Message Queue

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.