hdu 1509 Windows Message Queue

题目连接

http://acm.hdu.edu.cn/showproblem.php?pid=1509 

Windows Message Queue

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!

优先队列裸题。。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<map>
using std::cin;
using std::cout;
using std::endl;
using std::find;
using std::sort;
using std::map;
using std::pair;
using std::vector;
using std::string;
using std::priority_queue;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) decltype((c).begin())
#define cls(arr,val) memset(arr,val,sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
const int N = 256;
typedef unsigned long long ull;
struct Node {
    string name;
    int val, fix, id;
    Node() {}
    Node(string nam, int v, int f, int i) : name(nam), val(v), fix(f), id(i){}
    friend bool operator<(const Node &a, const Node &b) {
        return a.fix == b.fix ? a.id > b.id : a.fix > b.fix;
    }
};
priority_queue<Node> que;
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int a, b, k = 1;
    char buf[N], msg[N];
    while (gets(buf)) {
        if (!strcmp(buf, "GET")) {
            if (que.empty()) { puts("EMPTY QUEUE!"); continue; }
            Node ret = que.top(); que.pop();
            printf("%s %d
", ret.name.c_str(), ret.val);
        } else {
            sscanf(buf + (strchr(buf, ' ') - buf) + 1, "%s %d %d", msg, &a, &b);
            que.push(Node(msg, a, b, k++));
        }
    }
    return 0;
}