hdoj- Windows Message Queue

本文介绍了一个基于优先级的消息队列模拟程序,通过处理GET和PUT命令来模拟Windows系统中的消息队列行为。输入包括添加消息到队列(PUT)及从队列中获取消息(GET),输出则展示了队列的操作结果。

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

                    Windows Message Queue

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<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
struct Message
{
	char str[100];
	int l;
	int z;
	int por;
friend bool operator < (Message a,Message b)
{
	if(a.por==b.por)
	return a.z>b.z;
	else return a.por>b.por;
}
};
int main()
{
	int i,j,z=1;
	Message message1;
	Message message2;
	char mess[100];
	priority_queue<Message>q;
	while(!q.empty()) q.pop();
	while(~scanf("%s",mess))
	{
		
		
		if(strcmp(mess,"PUT")==0)
		{
			message1.z=z++;
			scanf("%s%d%d",message1.str,&message1.l,&message1.por);
			q.push(message1);
		}
		
		if(strcmp(mess,"GET")==0)
		{
			if(q.empty()==1) 
			printf("EMPTY QUEUE!\n");
			else
			{
				message2=q.top();
				q.pop();
				printf("%s %d\n",message2.str,message2.l);
			}
		}
	}
	return 0;
}



 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值