杭电1509--Windows Message Queue（优先队列）

Windows Message Queue

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

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!

 

 

Author

ZHOU, Ran

 

 

Source

Zhejiang University Local Contest 2006, Preliminary

 

 

Recommend

linle   |   We have carefully selected several similar problems for you:  1873 1512 1387 1710 1896 

//AC :

#include <queue>
#include <cstdio>
#include <cstring>
using namespace std;

struct ac
{
    char ch[10];
    int para, pri, id;
    friend bool operator < (ac para, ac pri)
    {
        if(para.pri == pri.pri)
        return para.id > pri.id;   //从小 → → 大；
        else
        return para.pri > pri.pri; //*优先级比较,数越小，优先级越大*
    }
};

int main()
{
    ac t;
    int a, b, ans= 0;
    char ko[10], s[10];
    priority_queue <ac> q;
    //priority_queue <int, vector<int>, greater<int> > q; // 小 → → 大 ； 
    //priority_queue <int, vector<int>, less<int> > q;     // 大 → → 小； 
    while(~scanf("%s", s))
    {
        if(s[0] == 'P')
        {
            scanf("%s %d %d", ko, &a, &b);
            strcpy(t.ch, ko);
            t.para = a;
            t.pri = b;
            t.id = ++ans;
            q.push(t);
        }
        else
        {
            if(!q.empty())
            {
                t = q.top();
                q.pop();
                printf("%s %d
", t.ch, t.para); 
            }
            else
            printf("EMPTY QUEUE!
");
        }
    }
    return 0;
}