Windows Message Queue ——优先队列模拟

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!

题意：GET从系统得到命令，PUT给系统输入命令

GET原则：按优先级（优先级数值低者优先级高），优先级相同再按时间先后，时间在前者优先级高。

代码：

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<list>
#include<iterator>
#include<stack>
using namespace std;
#define ll long long int 
#define ull unsigned long long int 
#define e 2.718281828459
#define INF 0x7fffffff
#pragma warning(disable:4996)
#define pf printf
#define sf scanf
#define max(a,b) (a)>(b)?(a):(b);
#define min(a,b) (a)<(b)?(a):(b);
#define pi  acos(-1.0);
#define  eps 1e-9;
#define MAX 1000000+10
#include <queue>



struct Node {
    int n;
    int pri;
    int cnt;
    char name[20];
    friend bool operator<(const Node the, const Node a) {
        if (the.pri != a.pri)
            return the.pri > a.pri;
        else
            return the.cnt > a.cnt;
    }

};


int main(void) {
    char m[4];
    priority_queue<Node> p;
    int cnt=1;
    while (sf("%s", m) != EOF) {
        if (m[0] == 'G') {
            if (!p.empty()) {
                Node temp = p.top();
                pf("%s %d\n", temp.name, temp.n);
                p.pop();
            }
            else
                pf("EMPTY QUEUE!\n");

        }

        else if (m[0] == 'P') {
            Node temp;
            sf("%s %d %d", temp.name, &temp.n, &temp.pri);
            temp.cnt = cnt++;
            p.push(temp);
        }
    }

    while (!p.empty())
        p.pop();


    return 0;
}