zoukankan      html  css  js  c++  java
  • ZOJ2724_Windows Message Queue(STL/优先队列)

    解题报告

    题意:

    看输入输出就非常明确。

    思路:

    优先队列。

    #include <algorithm>
    #include <iostream>
    #include <cstring>
    #include <cmath>
    #include <queue>
    #include <vector>
    #include <cstdio>
    #include <map>
    
    using namespace std;
    struct node {
        char m[100];
        int v,k;
        friend bool operator <(node a,node b) {
            return a.k>b.k;
        }
    };
    priority_queue<node>Q;
    int main() {
        char str[100],str1[1000];
        int a,b;
        while(~scanf("%s",str)) {
            if(strcmp(str,"GET")==0) {
                if(Q.empty())
                    printf("EMPTY QUEUE!
    ");
                else {
                    node a=Q.top();
                    Q.pop();
                    printf("%s %d
    ",a.m,a.v);
                }
            } else if(strcmp(str,"PUT")==0) {
                scanf("%s%d%d",str1,&a,&b);
                node o;
                strcpy(o.m,str1);
                o.v=a;
                o.k=b;
                Q.push(o);
            }
        }
        return 0;
    }
    

    Windows Message Queue

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    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!

  • 相关阅读:
    分页SQL取下一页
    取第10行到100行
    Flash Builder4.0新建Flex应用程序切换主题出错
    C++浮点数(float、double)类型数据比较、转换分析总结
    浮点数的大小比较
    052新题1
    一致读原理
    Redis配置文件解读
    Redis系列-远程连接redis并给redis加锁
    svn提交更新原则
  • 原文地址:https://www.cnblogs.com/yxysuanfa/p/7102152.html
Copyright © 2011-2022 走看看