hdu 1509【Windows Message Queue】

直接暴力，虽然效率很差。。。。。。

#include <iostream>
#include <queue>
using namespace std;

struct node
{
    char name[100];
    int para;
    int prio;
    int id;
    friend bool operator < (const node& a,const node& b)
    {
        if(a.prio == b.prio)
            return a.id > b.id;

        return a.prio > b.prio;
    }
};

int main()
{
    priority_queue<node> q;
    char str[5];
    int id = 1;
    while(cin >> str)
    {
        if(str[0] == 'G')
        {
            if(q.empty())
            {
                cout << "EMPTY QUEUE!" << endl;
            }
            else
            {
                cout << q.top().name <<" " << q.top().para << endl;
                q.pop();
            }
        }
        else
        {
            node a;
            cin >> a.name >> a.para >> a.prio;
            a.id = id ++;
            q.push(a);
        }
    }

    return 0;
}