C - Windows Message Queue

本文介绍了一个基于Windows系统的消息队列模拟程序。该程序能够处理多达60,000条命令,包括添加消息(PUT)和从消息队列中获取消息(GET)。通过优先级确定消息处理顺序,并遵循相同优先级下先进先出(FIFO)的原则。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;


struct node
{
    char str[50];
    int k;
    int num;
    int id;
    friend bool operator<(node a,node b )
    {
        if(a.id !=b.id )
        return a.id>b.id;
        else
        return a.num >b.num ;     
    }

}dp;

char s[10]; 
priority_queue<node>qu;
int main()
{
int num=1;
    while(scanf("%s",s)!=EOF)
    {

        if(s[0]=='G')
        {
            if(!qu.empty())
            {
                node s1;
                s1=qu.top();
                printf("%s %d\n",s1.str,s1.k);
                qu.pop();
            }
            else
            {
                printf("EMPTY QUEUE!\n");
            }
        }
        else
        {
            node z;
            z.num =num++;
            scanf("%s %d %d",z.str,&z.k,&z.id );
            qu.push(z);
        }

    }



    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值