hdu 1509 1873（）病人要看病 优先队列（符号重载）

struct node
{
    char str[100];
    int par;
    int pri;
    int index;
    bool operator<(const node &x) const
    {
        if(pri!=x.pri)
            return pri>x.pri;  //按照pri越小优先级越大
        else
            return index>x.index;//按照索引越小优先级越大
    }
};

 1 #include<iostream>
 2 #include<stdio.h>
 3 #include<string>
 4 #include<string.h>
 5 #include<algorithm>
 6 #include<math.h>
 7 #include<vector>
 8 #include<stack>
 9 #include<queue>
10 
11 using namespace std;
12 struct node
13 {
14     char str[100];
15     int par;
16     int pri;
17     int index;
18     bool operator<(const node &x) const
19     {
20         if(pri!=x.pri)
21             return pri>x.pri;  //按照pri越小优先级越大
22         else
23             return index>x.index;//按照索引越小优先级越大
24     }
25 };
26 
27 
28 int main()
29 {
30     priority_queue<node> que;
31     int k=0;
32     char cmd[4];
33     node  temp;
34     while(cin>>cmd)
35     {
36         if(strcmp(cmd,"GET")==0)
37         {
38             if(!que.empty())
39             {
40                 temp=que.top();
41                 cout<<temp.str<<‘ ‘<<temp.par<<endl;
42                 que.pop();
43 
44             }
45             else
46             {
47                 cout<<"EMPTY QUEUE!"<<endl;
48             }
49         }
50         else
51         {
52             cin>>temp.str>>temp.par>>temp.pri;
53             temp.index=++k;
54             que.push(temp);
55         }
56     }
57     return 0 ;
58 }

#include<string>
#include<string.h>
#include<queue>
#include<map>
#include<stack>
#include <iostream>
#include <stdio.h>
#include <cmath>
using namespace std;
int n;
int i,j;
char str[4];
struct man{
    int id;
    int level;
    bool operator<(const man m) const{
        if(level!=m.level)
            return m.level>level;
        else return m.id<id;
    }
};
priority_queue<man>q[3];  //全局变量，故需要清空

int main()
{
    int id,level,doc;
    man people;
while(cin>>n){
//优先队列数组清空
    for(i=0;i<3;i++)
            while(!q[i].empty())
                q[i].pop(); 
////////////////////
     id=1;
     while(n--){
         cin>>str>>doc;
         if(!strcmp(str,"IN"))
         {
             cin>>people.level;
             people.id=id++;
             q[doc-1].push(people);
         }
         else{
             if(!q[doc-1].empty()){
                 cout<<q[doc-1].top().id<<endl;
                 q[doc-1].pop();
             }
             else cout<<"EMPTY"<<endl;
         }
        if(!strcmp(str,"IN")){

        }
    }
}
    return 0;
}