【ZOJ - 2724】【HDU - 1509】Windows Message Queue（优先队列）

题干：

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!

解题报告：

优先队列直接解。刚开始数组开太大了疯狂超内存。我还在node上加了个[MAX] 出现了这个报错 Segmentation Fault

AC代码：

#include<bits/stdc++.h>using namespace std;
const int MAX = 6e4 + 5;
struct Node {int id;char name[400];int k;//参数int vip;//Node(int id,char name[MAX],int k,int vip):id(id),name(name),k(k),vip(vip){}bool operator<(const Node b) const {if(vip!=b.vip) return vip>b.vip;return id>b.id;}
} node;
priority_queue <Node> pq;
char tmpname[MAX];
int main()
{char op[10];int cnt = 0;int k,v;while(~scanf("%s",op) ) {if(op[0] == 'G') {if(!pq.empty() ) {Node cur = pq.top();pq.pop();printf("%s %d\n",cur.name,cur.k);}else printf("EMPTY QUEUE!\n");}else {cnt++;scanf("%s%d%d",tmpname,&k,&v);Node tmp;tmp.id = cnt;tmp.k = k;tmp.vip = v;strcpy(tmp.name,tmpname);pq.push(tmp);}}return 0 ;
}

【ZOJ - 2724】【HDU - 1509】Windows Message Queue（优先队列）相关推荐

HDOJ 1509 Windows Message Queue
Windows Message Queue Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Othe ...
Windows Message Queue（优先队列）
欢迎参加--BestCoder周年纪念赛(高质量题目+多重奖励) Windows Message Queue Time Limit: 2000/1000 MS (Java/Others) Mem ...
D - Windows Message Queue
来源hdu1509 Message queue is the basic fundamental of windows system. For each process, the system mai ...
ZOJ2724_Windows Message Queue(STL/优先队列)
解题报告题意: 看输入输出就非常明确. 思路: 优先队列. #include <algorithm> #include <iostream> #include <cst ...
MSMQ（Microsoft Message Queue）介绍
利用 MSMQ(Microsoft Message Queue),应用程序开发人员可以通过发送和接收消息方便地与应用程序进行快速可靠的通信.消息处理为您提供了有保障的消息传递和执行许多业务处理的可靠的 ...
Microsoft Message Queue（MSMQ：微软消息队列）简介
一.前言最近在安装公司的一个产品时,接触到了MSMQ,在此对MSMQ做一个简单的介绍,以便各位能对它有一个快速.直观的认识.本文针对于Microsoft Message Queue,以下提到的消息队 ...
Message、Handler、Message Queue、Looper之间的关系
2019独角兽企业重金招聘Python工程师标准>>> 在单线程模型下,为了解决线程通信问题,Android设计了一个通信机制.Message Queue(消息队列), 线程间的通信 ...
远程调用服务(RPC)和消息(Message Queue)对比及其适用/不适用场合
在阿里的平台技术部参与开发了Dubbo(远程调用服务)和Napoli(消息解决方案),又给网站应用支持这2个产品很长一段时间,了解了这2个产品的实现及应用对这两个产品的用法. 大部分情况下," ...
Message Queue中的推与拉（转）
Message Queue的设计和实现(7) http://mp.weixin.qq.com/s/zQdDBAHu1UgJJzxH2eCHgQ 数据发送中的推与拉. 当MQ要把数据给消费者的时候,就涉 ...

【ZOJ - 2724】【HDU - 1509】Windows Message Queue（优先队列）

【ZOJ - 2724】【HDU - 1509】Windows Message Queue（优先队列）相关推荐

最新文章

热门文章