S
来源:互联网 发布:变声器软件哪个好 编辑:程序博客网 时间:2024/04/28 20:53
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!
就是PUT代表输入队列,get代表输出队列,如果队列是空的就输出EMPTY QUEUE!否则输出内容,put后跟着三个信息,第三个是优先级,优先级大的反而小,优先级相同,输出先出现的
分析:
用优先队列就行
代码:
#include<bits/stdc++.h>using namespace std;struct can{ string a,b; long int c; bool operator<(const can h)const { return c>h.c; }};int main(){ string s; priority_queue<can>v; can f; while(cin>>s) { if(s=="GET"&&v.size()==0) cout<<"EMPTY QUEUE!"<<endl; else if(s=="GET") { cout<<v.top().a<<" "<<v.top().b<<endl; v.pop(); } else { cin>>f.a>>f.b>>f.c; v.push(f); } }}
感受:我感觉这是有史以来叫我最憋屈的题我按照题目要求控制输入的个数竟然不能通过,我交了6遍没有过,然后把控制输入量的删了就过了。。。真是气死我了
- s
- s
- s
- s
- s
- s
- s
- s
- s
- S
- S
- s
- S
- s
- s
- s
- s
- s
- [LeetCode]516. Longest Palindromic Subsequence
- 一本正经的胡说八道
- Android GreenDao使用详解——(上)增删改查
- Android Studio使用命令行打包配置
- net.sf.json.JSONObject 和org.json.JSONObject 的差别
- S
- hive partition的使用
- CCF201503-1-图像旋转
- Hawq 配置本地使用psql登陆
- Qt5 OpenGL学习之路1
- POJ 1182-食物链 [并查集] 《挑战程序设计竞赛》2.4
- 【LeetCode】413. Arithmetic Slices
- Gradle语法基础解析
- 程序代码统计小程序