zoukankan      html  css  js  c++  java
  • zoj 2724 Windows Message Queue

    Windows Message Queue

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    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!
    

     解题思路:用一个优先队列就解决了。

     1 #include <iostream>
     2 #include <queue>
     3 #include <cstring>
     4 #include <cstdio>
     5 using namespace std;
     6 struct Message{
     7     char str[100];
     8     int parameter;
     9     int priority;
    10 };
    11 struct mycmp{
    12     bool operator () (const Message &a, const Message &b){
    13         return a.priority > b.priority;
    14     }
    15 };
    16 priority_queue<Message, vector<Message>, mycmp> pq;
    17 int main(){
    18     char s[4];
    19     Message message;
    20     while(scanf("%s", s) != EOF){
    21         if(strcmp(s, "GET") == 0){
    22             if(pq.empty()){
    23                 printf("EMPTY QUEUE!
    ");
    24                 continue;
    25             } else {
    26                 printf("%s %d
    ", pq.top().str, pq.top().parameter);
    27                 pq.pop();
    28             }
    29         } else if (strcmp(s, "PUT") == 0){
    30             scanf("%s %d %d", message.str, &message.parameter, &message.priority);
    31             pq.push(message);
    32         }
    33     }
    34     return 0;
    35 }
  • 相关阅读:
    2021 CCPC 桂林站 补题
    2021 ICPC 上海 流水账
    2021 ICPC 沈阳 补题
    vi中的多行注释和取消注释
    查询列表可筛选可模糊查询的写法
    mybatisplus逻辑删除deleted
    @JsonFormat
    @Component类相互引用的加载顺序
    Chrome浏览器嗅探方法
    DataAdapter.FillSchema 方法
  • 原文地址:https://www.cnblogs.com/qinduanyinghua/p/6529246.html
Copyright © 2011-2022 走看看