模拟窗口消息队列
来源:互联网 发布:日购网怎么样知乎 编辑:程序博客网 时间:2024/06/03 11:35
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!
===============================================
算法:(主要是优先队列的用法:
1.输入命令;
2.判断是GET还是PUT
3.若是PUT,则输入str,par,pri,按pri大小升序,若pri相同,则根据接受的先后顺序(计数),
存入优先队列
4.若是GET,则判断优先队列中是否数据
a.优先队列不为空:输出最底端数据的str和par (先进先出
b.优先队列为空,输出空。
5.返回1,直到不再输入命令
====================================
#include<iostream>#include<cstring>#include<queue>#include<algorithm>using namespace std;struct node{char str[100];int a, b, t;friend bool operator <(node x, node y){if (x.b != y.b) return x.b > y.b;return x.t > y.t;}};node p;priority_queue<node> s;int main(){char com[10];int a, b, count = 0;while (~scanf("%s", com)){if (strcmp(com,"GET")==0){if (!s.empty()){printf("%s %d\n", s.top().str,s.top().a);s.pop();}else printf("EMPTY QUEUE!\n");}else{scanf("%s %d%d", p.str, &p.a, &p.b);p.t = ++count;s.push(p);}}return 0;}
- 模拟窗口消息队列
- hook 窗口消息队列
- 模拟消息队列
- WTL 窗口创建消息队列
- 用MySQL模拟消息队列
- 为控制台窗口建立消息队列
- 模拟window Message Queue 消息队列 算法
- 用消息队列模拟生产者消费者模型
- rabbitMQ模拟消息队列群发邮件
- 模拟聊天窗口的消息实现
- 模拟按键给窗口发消息
- FAQ12:每个线程一个消息队列?还是线程中的每个窗口各有一个消息队列?
- linux下消息队列性能比较(SVr4, POSIX, 信号量模拟消息队列)
- 为控制台窗口建立消息队列(转载处也没标明出处)
- 在Linux环境中用模拟Windows中的线程消息队列
- 使用消息队列读取模拟量的值
- 文本数据处理—结合mysql模拟实现消息队列
- 如何通过想窗口控件发消息模拟点击按键
- java中JTextArea添加滚动条
- 源码(三)
- Codeforces 479E Riding in a Lift DP+前缀和
- udp用户数据报协议的实现
- python爬虫抓取MM图(www.mmjpg.com)
- 模拟窗口消息队列
- git pull冲突
- :-1: 错误:cannot open output file release/first.exe: Permission denied
- 【PAT】【Advanced Level】1004. Counting Leaves (30)
- 百度地图
- 录屏软件 gif
- 关于取消浮动影响的多种方法及优缺点比较
- 字符串——最长无重复子串
- iwebshop模拟秒杀