ZOJ2724_Windows Message Queue(STL/优先队列)

2020-12-13 06:16

阅读：439

标签：style blog color os io strong for 2014

解题报告

题意：

看输入输出就很明白。

思路：

优先队列。

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;
struct node {
    char m[100];
    int v,k;
    friend bool operator b.k;
    }
};
priority_queueQ;
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!\n");
            else {
                node a=Q.top();
                Q.pop();
                printf("%s %d\n",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!

ZOJ2724_Windows Message Queue(STL/优先队列),搜素材,soscw.com

ZOJ2724_Windows Message Queue(STL/优先队列)

标签：style blog color os io strong for 2014

原文地址：http://blog.csdn.net/juncoder/article/details/38459285

上一篇：LeetCode in Python 102. Binary Tree Level Order Traversal

下一篇：<script> 为什么不再使用 type="text/javascript" 【问题】

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：ZOJ2724_Windows Message Queue(STL/优先队列)
文章链接：http://soscw.com/essay/32778.html

亲，登录后才可以留言！

ZOJ2724_Windows Message Queue(STL/优先队列)

评论

热门文章

推荐文章

最新文章

置顶文章