hdu 1509 Windows Message Queue (优先队列)

2021-07-14 03:13

阅读：589

标签：ble algorithm higher \n proc ace app stream ice

Windows Message Queue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9202 Accepted Submission(s): 3836

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
GET
PUT msg1 10 5
PUT msg2 10 4
GET
GET
GET

Sample Output
EMPTY QUEUE!
msg2 10
msg1 10
EMPTY QUEUE!

C/C++：

 1 #include  2 #include  3 #include  4 #include  5 #include string>
 6 #include  7 #include  8 #include  9 #include 10 #include 
11 #define INF 0x3f3f3f3f
12 using namespace std;
13 const int MAX = 20;
14 
15 char buf[MAX];
16 int id = 1;
17 
18 struct node
19 {
20     char name[MAX];
21     int n, val, id;
22     friend bool operator  (node a, node b)
23     {
24         if (a.val != b.val)
25             return a.val > b.val;
26         return a.id > b.id;
27     }
28 };
29 
30 int main()
31 {
32     priority_queue  Q;
33     while (~scanf("%s", &buf))
34     {
35         if (strcmp(buf, "GET") == 0)
36         {
37             if (Q.empty()) printf("EMPTY QUEUE!\n");
38             else
39             {
40                 printf("%s %d\n", Q.top().name, Q.top().n);
41                 Q.pop();
42             }
43         }
44         else
45         {
46             node temp;
47             temp.id = id ++;
48             scanf("%s %d %d", &temp.name, &temp.n, &temp.val);
49             Q.push(temp);
50         }
51     }
52 }

hdu 1509 Windows Message Queue (优先队列)

标签：ble algorithm higher \n proc ace app stream ice

原文地址：https://www.cnblogs.com/GetcharZp/p/9551707.html

上一篇：c# 格式化

下一篇：windows下安装jandgo

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：hdu 1509 Windows Message Queue (优先队列)
文章链接：http://soscw.com/index.php/essay/104925.html

亲，登录后才可以留言！

hdu 1509 Windows Message Queue (优先队列)

评论

热门文章

推荐文章

最新文章

置顶文章