zoukankan      html  css  js  c++  java
  • Windows Message Queue(容器之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!
    

    #include <iostream>
    #include <string>
    #include <queue>
    using namespace std;
    struct node
    {string a;
    int b,c,d;
    bool friend operator<(node n1,node n2)
    {
     if(n1.c==n2.c)return n1.d>n2.d;
     return n1.c >n2.c;
    }
    }s;

    int main()
    { priority_queue<node>q;
    string a1;
    int k=1;
    while(cin>>a1)
    {if(a1[0]=='G')
    {if(!q.empty())
    {s=q.top();
    q.pop();
    cout<<s.a<<" "<<s.b<<endl;}
    else cout<<"EMPTY QUEUE!"<<endl;

    }
    else {cin>>s.a>>s.b>>s.c;
    s.d=k++;
    q.push(s);}
    }
    return 0;}


  • 相关阅读:
    每天出门前,记得提醒自己一遍,别落下了梦想
    逐帧动画 and 有限状态机(fsm)
    【备忘】指定为同名callback的jsonp && IE下script loaded状态标记
    【NodeCC】nodejs版本的脚本压缩和compo工具
    半年拾遗
    context2D上的texture mapping
    软件系统配置UI(QT)
    MongoDB增加排序内存版本4.4.1
    搭建Mingw64环境并使用git管理ffmpeg
    js 运算符
  • 原文地址:https://www.cnblogs.com/lengxia/p/4387810.html
Copyright © 2011-2022 走看看