hdu1873 看病要排队

//c++  STL就是好用,不会c++,写的蛋疼啊

//转发

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

struct node
{
	int id,num;
	friend bool operator < (node a,node b)
	{
		if(a.num!=b.num)
			return a.num<b.num;
		else
			return a.id>b.id;
	}
};

int main()
{
	int n,a,b,count;
	char str[5];
	node t;
	while((cin>>n)&&n)
	{
		count=0;
		priority_queue <node>q[4];
		while(n--)
		{
			scanf("%s",str);
			if(str[0]=='I')
			{
				scanf("%d %d",&a,&b);
				t.id=++count;
				t.num=b;
				q[a].push(t);
			}
			else
			{
				scanf("%d",&a);
				if(!q[a].empty())
				{
					t=q[a].top();
					q[a].pop();
					printf("%d\n",t.id);
				}
				else
					printf("EMPTY\n");
			}
		}
	}
	return 0;
}