【杭电-oj】-1509-Windows Message Queue(优先队列)
来源:互联网 发布:广州中名软件 编辑:程序博客网 时间:2024/05/16 13:53
Windows Message Queue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5307 Accepted Submission(s): 2120
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
GETPUT msg1 10 5PUT msg2 10 4GETGETGET
Sample Output
EMPTY QUEUE!msg2 10msg1 10EMPTY QUEUE!
#include<cstdio>#include<algorithm>#include<queue>using namespace std;struct node{int p,num,a1;char name[40];bool friend operator <(node a,node b){if(a.p!=b.p)return a.p>b.p;//数值小优先级高 ,先进 elsereturn a.num>b.num;//先到数小,先进 }}pr;int main(){int ant =0;char op[4];int a,b;priority_queue<node> q1;//用到node结构体里的p,num,name while(~scanf("%s",op)){if(op[0]=='P'){scanf("%s",pr.name);//name直接定义在结构体中 scanf("%d%d",&a,&b);pr.num=++ant;//只有一个队列,其实可以直接定义结构体里的p,a1如: pr.p=b;//scanf("%d %d",&pr.a1,&pr.b) ;pr.a1=a;q1.push(pr);}else{if(q1.empty())printf("EMPTY QUEUE!\n");else{pr=q1.top();q1.pop();printf("%s %d\n",pr.name,pr.a1);}}}}
0 0
- 【杭电oj】1509 - Windows Message Queue(优先队列)
- 【杭电-oj】-1509-Windows Message Queue(优先队列)
- 【杭电OJ】1509--Windows Message Queue(优先队列)
- hdu 杭电1509 Windows Message Queue【优先队列】
- Windows Message Queue(杭电oj1509)(优先队列)
- hdu 1509 Windows Message Queue 优先队列
- hdu 1509 Windows Message Queue(优先队列)
- HDU-1509-Windows Message Queue(优先队列)
- HDU 1509 Windows Message Queue 【优先队列】
- hdoj 1509 Windows Message Queue 优先队列
- hdoj 1509 Windows Message Queue(优先队列)
- HDOJ 1509 Windows Message Queue(优先队列)
- hdu-1509 Windows Message Queue(优先队列)
- HDU 1509:Windows Message Queue【优先队列】
- HDU 1509 Windows Message Queue(优先队列)
- HDUoj 1509 Windows Message Queue ( 优先队列
- Windows Message Queue(priority_queue优先队列)
- hdoj1509 Windows Message Queue (优先队列)
- 数据库高可用架构(MySQL、Oracle、MongoDB、Redis)
- git merge 单个文件
- Thread、ThreadGroup、ThreadFactory、ThreadPoolExecutor
- logback myBatis 3.0+ 如何打印 sql
- Redis的持久化-AOF
- 【杭电-oj】-1509-Windows Message Queue(优先队列)
- 判断苹果各种智能手机设备型号
- android namevaluepair 过时
- android中子线程更新UI的几种方法
- 【那些年遇到过的面试题】netstat/tcpdump/traceroute/ss/probe
- 通过sqoop增量传送oracle数据到hive
- php openssl rsa 加密解密应用
- java三大特性之————封装
- 20160630整理到cloudeye攻击的一些姿势