hdu 1873【看病要排队】

直接模拟。。。

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

typedef pair<int,int> pii;

struct node
{
    int id,kb;
    node(){}
    node(int a,int b)
    {
        id = b;
        kb = a;
    }
    friend bool operator <(const node& a,const node& b)
    {
        if(a.kb == b.kb)
            return a.id > b.id;

        return a.kb < b.kb;
    }
};

int main()
{
    int n;
    while(cin >> n)
    {
        priority_queue<node> q[4];

        char str[5];
        int id = 1;
        while(n --)
        {
            int a;
            cin >> str >> a;
            if(str[0] == 'I')
            {
                int b;
                cin >> b;
                q[a].push(node(b,id));
                id ++;
            }
            else
            {
                if(q[a].empty())
                {
                    cout << "EMPTY" << endl;
                }
                else
                {
                    cout << q[a].top().id << endl;
                    q[a].pop();
                }
            }
        }

    }
    return 0;
}