zoukankan      html  css  js  c++  java
  • HDU 1509 Windows Message Queue

    题目链接:

    http://acm.split.hdu.edu.cn/showproblem.php?pid=1509

    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!

    Hint:

    题意:

    优先队列。

    题解:

    优先队列,水题。

    代码: 

    #include <cstdio>
    #include <cstring>
    #include <queue>
    #include <iostream>
    #include <algorithm>
    using namespace std;
    struct node
    {
        char name[100+10];
        int x,val;
        int time;
        friend bool operator <(node a,node b)
        {
            if(a.val!=b.val)
                return a.val>b.val;
            return a.time>b.time;
        }
    }s;
    char a[10];
    int main()
    {
        int num=0;
        priority_queue<node>q;
        while(!q.empty())
            q.pop();
        while(scanf("%s",a)!=EOF)
        {
            if(strcmp(a,"GET")==0)
            {
                if(q.empty())
                    printf("EMPTY QUEUE!
    ");
                else
                {
                    node b=q.top();
                    q.pop();
                    printf("%s %d
    ",b.name,b.x);
                }
            }
            else
            {
                scanf("%s %d %d",s.name,&s.x,&s.val);
                s.time=num++;
                q.push(s);
            }
        }
    }
    
  • 相关阅读:
    WPF 打开文件 打开路径对话框
    WPF Button添加图片
    Delphi 正则表达式PerlRegEx
    解决Inet控件下载utf8网页乱码的问题
    Delphi程序结构
    VB 936(gb2312)URL编码与解码
    Chr 将一个有序数据转换为一个ANSI字符
    Delphi正则表达式使用方法(TPerlRegEx)
    Delphi类型转换
    Delphi 正则表达式TPerlRegEx 类的属性与方法
  • 原文地址:https://www.cnblogs.com/TAT1122/p/5835473.html
Copyright © 2011-2022 走看看