HDU 1509
来源:互联网 发布:ug五轴编程工资多少钱 编辑:程序博客网 时间:2024/05/22 04:49
Windows Message Queue
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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!
输入多组数据,如果输入GET,就输出队列顶部元素,如果输入PUT,那么依次输入元素的名字,优先级,数值。在队列内部,排列顺序按照优先级排序,其中如果参数数值越大,那么优先级越低,反之越小。
二.思路过程
优先级队列
按照输入输出入队出队
三.代码
#include <iostream>#include <cstdio>#include <queue>#include <string.h>using namespace std;struct node{ char name[10]; int canshu; int priority; int num; bool operator < (const node &b) const { if(priority == b.priority) return num>b.num; return priority>b.priority; }};int main(){ int tot = 0; char str[20]; priority_queue<node>Q; while(scanf("%s", str)!=EOF) { if(strcmp(str, "GET")==0) { if(!Q.empty()) { printf("%s %d\n", Q.top().name, Q.top().canshu); Q.pop(); } else printf("EMPTY QUEUE!\n"); } else { node temp; scanf("%s%d%d", &temp.name, &temp.canshu, &temp.priority); temp.num=++tot; Q.push(temp); } } return 0;}/*GETPUT msg1 10 5PUT msg2 10 4GETGETGET*/
0 0
- hdu 1509
- HDU 1509
- HDU 1509
- HDU 1509
- hdu 1509
- HDU-1509 优先队列
- hdu 1509 优先队列
- hdu 1509 优先队列
- hdu 1509队列优先
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- tarjan帮我来找桥
- 数据结构-栈&队列&单向链表
- 五个问题
- 奇怪的Dll中的stl内存泄露
- tjut 3746
- HDU 1509
- Appcompat导入后出错及Material Design 支持库导入出错的解决办法
- 设计模式之七大原则
- Apache Mina的IoService接口学习笔记
- 数据结构实验之排序七:选课名单
- 【c++ primer 笔记】第七章 类
- 简单套接字通信
- android项目开发过程中的本地缓存总结
- 浅谈CSRF攻击方式