HDU1873 看病要排队
Time limit1000 ms
Memory limit32768 kB
这是一道典型的优先队列题目,要点就是把病人分给三个医生并编号,然后从中选取优先级高的病人。值得注意的是优先级相同时选取排在前列的病人,所以在判定优先级时可以从后往前推。下面附上AC代码(本人代码习惯较差)
#include <iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int a[3][2020];
char s[20];
int main()
{
int N;
while(scanf("%d",&N)!=EOF){
int k=0;
memset(a,0,sizeof(a));
while(N--){
scanf("%s",s);
if(s[0]=='I'){
int doctor,level;
cin>>doctor>>level;
a[doctor-1][k]=level;
k++;
}
else{
int doctor;
cin>>doctor;
int max1=0,p;
for(int i=k;i>=0;i--){
if(a[doctor-1][i]>=max1){
max1=a[doctor-1][i];
p=i;
}
}
if(max1==0) cout<<"EMPTY"<<endl;
else{
a[doctor-1][p]=0;
cout<<p+1<<endl;
}
}
}
}
}