杭电HDU1873-看病要排队

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1873

C语言源码：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define maxsize 3000
typedef struct patient
{
	int num;
	int rank;
}patient;
patient p1[maxsize],p2[maxsize],p3[maxsize];
int cmp(const void *a,const void *b)
{
	patient *aa=(patient *)a;
	patient *bb=(patient *)b;
	if(aa->rank!=bb->rank)
		return bb->rank-aa->rank;
	else
		return aa->num-bb->num;
}
int main()
{
	int n,i,front1,rear1,front2,rear2,front3,rear3,num,a,b;
	char s[10];
	while(scanf("%d",&n)!=EOF)
	{
		num=1;
		front1=0;
		front2=0;
		front3=0;
		rear1=0;
		rear2=0;
		rear3=0;
		while(n--)
		{
			scanf("%s",s);
			if(strcmp(s,"IN")==0)
			{
				scanf("%d %d",&a,&b);
				switch(a)
				{
				case 1:p1[rear1].num=num++;p1[rear1++].rank=b;qsort(&p1[front1],rear1-front1,sizeof(p1[0]),cmp);break;
				case 2:p2[rear2].num=num++;p2[rear2++].rank=b;qsort(&p2[front2],rear2-front2,sizeof(p2[0]),cmp);break;
				case 3:p3[rear3].num=num++;p3[rear3++].rank=b;qsort(&p3[front3],rear3-front3,sizeof(p3[0]),cmp);break;
				}
			}
			else
			{
				scanf("%d",&a);
				switch(a)
				{
				case 1:if(front1!=rear1)printf("%d\n",p1[front1++].num);else printf("EMPTY\n");break;
				case 2:if(front2!=rear2)printf("%d\n",p2[front2++].num);else printf("EMPTY\n");break;
				case 3:if(front3!=rear3)printf("%d\n",p3[front3++].num);else printf("EMPTY\n");break;
				}
			}
		}
	}
}