Windows Message Queue(HDU-1509)

最新推荐文章于 2024-03-08 10:53:03 发布

原创最新推荐文章于 2024-03-08 10:53:03 发布 · 306 阅读

0 ·

CC 4.0 BY-SA版权

STL 专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个消息队列的模拟实现，使用优先级队列来管理Windows系统中进程的消息。当进程发生如鼠标点击等事件时，系统将消息按优先级加入队列，高优先级消息先被处理，相同优先级遵循先进先出原则。

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!

代码如下：

#include<bits/stdc++.h>
using namespace std;
struct pp
{
    string a;
    int t,b;
};
pp c;
bool operator<(const pp&a,const pp&b)
{
    if(a.b!=b.b)
        return a.b>b.b;
    return a.t>b.t;
}
priority_queue<pp>p;
int main()
{
    string s,x;
    int cnt=0;
    while(getline(cin,s))
    {
        if(s[0]=='P')
        {
            int l,le=s.size();
            c.b=0;
            c.t=cnt++;
            c.a="";
            for(l=le-1;s[l]!=' ';l--);
            for(int i=l+1;i<le;i++)
                c.b=c.b*10+s[i]-'0';
            for(int i=4;i<l;i++)
                c.a+=s[i];
            p.push(c);
        }
        else
        {
            if(!p.empty())
            {
                c=p.top();
                cout<<c.a<<endl;
                p.pop();
            }
            else
                cout<<"EMPTY QUEUE!\n";
        }
    }
    return 0;
}