Windows Message Queue
2024-10-18 18:14:25
Windows Message Queue |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 85 Accepted Submission(s): 53 |
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 |
Sample Output
EMPTY QUEUE! |
Author
ZHOU, Ran
|
Source
Zhejiang University Local Contest 2006, Preliminary
|
Recommend
linle
|
/*
题意:简单的模拟两个操作:GET获取优先级最高的,PUT压进栈东西 初步思路:优先队列,搞一下,本来想偷一下懒。把以前写的代码贴上,结果死活不对。
*/
#include<bits/stdc++.h>
using namespace std;
struct node{
string name;
int val;
int Rank;
int time;
node(){}
node(string a,int b,int c,int d){
name=a;
val=b;
Rank=c;
time=d;
}
bool operator < (const node &other) const{
if(Rank==other.Rank)
return time>other.time;
return Rank>other.Rank;
}
};
priority_queue<node> Message;
string op;
string name;
int times=;
int val,Rank;
void init(){
times=;
while(!Message.empty()) Message.pop();
}
int main(){
// freopen("in.txt","r",stdin);
init();
while(cin>>op){
if(op=="GET"){
if(Message.empty()) puts("EMPTY QUEUE!");
else{
cout<<Message.top().name<<" "<<Message.top().val<<endl;
Message.pop();
}
}else{
cin>>name>>val>>Rank;
Message.push(node(name,val,Rank,times++));
}
}
return ;
}
最新文章
- html和css
- Java泛型学习笔记 - (二)泛型类
- php大力力 [050节] 兄弟连高洛峰 PHP教程 2014年[数据库、PDO教程]
- C#读书雷达
- Hibernate之N+1问题
- git 回退和删除操作
- Intent中的重要属性详解
- 下载文件夹里面的所有文件,并压缩成.zip压缩包的形式
- [LeetCode235]Lowest Common Ancestor of a Binary Search Tree
- 学习笔记: JavaScript/JQuery 的cookie操作
- C语言基础知识点整理(函数/变量/常量/指针/数组/结构体)
- 自建梯子教程:vultr+ssr+SwitchyOmega
- 【ANT】一个简单的ANT生成文件build.xml
- 在Bootstrap开发框架中使用bootstrap-datepicker插件
- python2x与python3x的区别
- 通过eclipse创建项目
- kbmmw 5.04 发布
- MyBatis高级篇之整合ehcache缓存框架
- mui框架(三)
- Swift语言从天而降,是否能掀起新一轮的科技革命?