Windows Message Queue

2021-02-13 21:18

阅读：384

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
#includestring >
#include
#includeusing namespace std;
struct kang
{
    char k[220];
    int a, b, c;
};
mapint, int> ko;
bool operator const kang & a, const kang & b)
{
    if (a.b != b.b)
        return a.b > b.b;
    return  a.c > b.c;
}
int main()
{
    priority_queue k;
    char str[10];
    while (cin >> str)
    {
        if (str[0] == ‘G‘)
        {
            if (k.empty())
                cout "EMPTY QUEUE!"  endl;
            else
            {
                kang kg;
                kg = k.top();
                k.pop();
                cout " " endl;
            }
        }
        else
        {
            kang kg;
            cin >> kg.k >> kg.a >> kg.b;
            kg.c = ko[kg.b]++;
            k.push(kg);
        }
    }
    return 0;
}

上一篇：WPF: WPF 中的 Triggers 和 VisualStateManager

下一篇：This is a bug I believe, and it took me 2-3 days to figure it out. Please do the following to get it

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

亲，登录后才可以留言！

Windows Message Queue

评论

热门文章

推荐文章

最新文章

置顶文章