看病要排队

#include<iostream>#include<stack>#include<queue>#include<stdio.h>using namespace std;class node{public :int id;int priority;node(int i,int p):id(i),priority(p){}};bool operator < (const node& a,const node& b){ //注意这里的重载运算符if(a.priority<b.priority){return true;}else if(a.priority==b.priority){if(a.id>b.id){return true;}}return false;}int main(){priority_queue<node> doctor[4];int n;char s[10];while(cin>>n){int id=0;int a,b;int i=0;for(;i<4;i++){while(!doctor[i].empty()){doctor[i].pop();}}for(i=0;i<n;i++){cin>>s;if(s[0]=='I'){id++;cin>>a>>b;doctor[a].push(node(id,b));}else if(s[0]=='O'){cin>>a;if(!doctor[a].empty()){node n=doctor[a].top();cout<<n.id<<endl;doctor[a].pop();}else{cout<<"EMPTY"<<endl;}}}}return 0;}