zoukankan      html  css  js  c++  java
  • Windows Message Queue(优先队列)

    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!

    优先队列的基本操作。

     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<queue>
     4 using namespace std;
     5 struct message
     6 {
     7     char name[110];
     8     int num;
     9     int id;
    10     int no;
    11     friend bool operator<(message a,message b)
    12     {
    13         if(a.no!=b.no)
    14             return a.no>b.no;
    15         return a.id>b.id;
    16     };
    17 };
    18 
    19 priority_queue<message>q;
    20 int main()
    21 {
    22     char s[4];
    23     int i=1;
    24     while(scanf("%s",s)!=EOF)
    25     {
    26         struct message a;
    27         if(strcmp(s,"GET")==0)
    28         {
    29             if(!q.empty())
    30             {
    31                 printf("%s %d
    ",q.top().name,q.top().num);
    32                 q.pop();///出队
    33             }
    34             else
    35             {
    36                 printf("EMPTY QUEUE!
    ");
    37             }
    38         }
    39         else
    40         {
    41             scanf("%s%d%d",a.name,&a.num,&a.no);
    42             a.id=i++;
    43             q.push(a);///入队
    44         }
    45     }
    46     return 0;
    47 }
    
    
    


  • 相关阅读:
    POJ2376 Cleaning Shifts
    百度首页图标
    NOIP2016换教室
    CH3803扑克牌
    【POJ2723】Get Luffy Out
    【USACO13DEC】 最优挤奶
    【SP2916】Can you answer these queries V
    【线段树】各种模板集合
    【SCOI2013】摩托车交易
    【CF1174D】 Ehab and the Expected XOR Problem
  • 原文地址:https://www.cnblogs.com/wkfvawl/p/8747580.html
Copyright © 2011-2022 走看看