HDOJ 1509 Windows Message Queue （优先队列）

最新推荐文章于 2018-12-28 20:21:08 发布

SIO__Five

最新推荐文章于 2018-12-28 20:21:08 发布

阅读量1k

点赞数

分类专栏： STL 文章标签： STL

本文链接：https://blog.csdn.net/sio__five/article/details/9069225

版权

STL 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一个基于优先级的消息队列模拟问题，该队列用于处理Windows系统中的各种事件，如鼠标点击和文本更改等。文章通过一个示例输入输出展示了如何使用C++实现这一模拟过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Windows Message Queue

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2346 Accepted Submission(s): 910

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
PUT msg1 10 5
PUT msg2 10 4
GET
GET
GET

Sample Output

  
  
   
   EMPTY QUEUE!
msg2 10
msg1 10
EMPTY QUEUE!
  
  
  
  

  
  
  
  

  
  
  
  
   
   解题思路：
  
  
  
  
   
   	优先队列的一个运用。贴一下代码吧
  
  
  
  

  
  
  
  
   
   代码：
  
  
  
  
   
   #include <cstdio>
#include <queue>
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
struct node
{
    string s;
    int m,n,i;
    friend bool operator<(const node &aa,const node &bb)
    {
        if(aa.n==bb.n)
            return aa.i>bb.i;
        return aa.n>bb.n;
    }
};
int main()
{
    int k=0;
    node aa;
    priority_queue<node> q;
    char str[10];
    while (cin>>str)
    {
        if(str[0]=='G')
        {
            if(!q.empty())
            {
                aa=q.top();
                q.pop();
                cout<<aa.s<<" "<<aa.m<<endl;
            }
            else
                cout<<"EMPTY QUEUE!"<<endl;
        }
        else
        {
            cin>>aa.s>>aa.m>>aa.n;
            aa.i=k++;
            q.push(aa);
        }
    }
}