HDOJ--1509--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.
输入描述:
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.
输出描述:
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.
输入：
GET
PUT msg1 10 5
PUT msg2 10 4
GET
GET
GET
输出：
EMPTY QUEUE!
msg2 10
msg1 10
EMPTY QUEUE!
题意：
消息队列是windows系统的基础。对于每个进程，系统维护一个消息队列。如果这个过程中发生了一些事情，比如鼠标单击、文本更改，系统将向队列中添加一条消息。同时，如果队列不是空的，进程将根据优先级值执行从队列获取消息的循环。请注意，优先级越低意味着优先级越高。在此问题中，将要求您模拟消息队列，以便将消息放入消息队列中并从消息队列中获取消息。
题解：
直接优先队列暴力
代码：

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

const int maxn = 100 + 5;
struct point {
    int val,odr,num;
    char s[maxn];
    bool operator <(const point & q)const{
        if (odr == q.odr) return num > q.num;
        else return odr > q.odr;
    }
};

priority_queue<point>pq;
void clearque(){
    while(!pq.empty()){
        pq.pop();
    }
    return;
}

char str[maxn];

int main(){
    int id = 0;
    while(scanf("%s",str)!=EOF){
        if(strcmp(str,"GET") == 0){
            if(pq.size() == 0) printf("EMPTY QUEUE!\n");
            else{
                point tmp = pq.top();
                pq.pop();
                printf("%s %d\n",tmp.s,tmp.val);
            }
        }
        else{
            point tmp;
            scanf("%s %d %d",tmp.s,&tmp.val,&tmp.odr);
            tmp.num = id ++;
            pq.push(tmp);
        }
    }
    return 0;
}