【优先队列】hdu 1434 幸福列车

Use priority_queue to simulate :

#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
const int MAXN = 10000+10;
using namespace std;

typedef struct{
    string name;
    int rp;
}node;

bool operator <( node x, node y ){
    if(x.rp>y.rp) return 1;
    else if(x.rp==y.rp && x.name<y.name) return 1;
    return 0;
}

priority_queue <node> q[MAXN];

int n,m;
node anode;
int main()
{
    while(scanf("%d %d",&n,&m)!=EOF){
        int t;
        for(int i=1;i<=n;i++){
            while(!q[i].empty()) q[i].pop();
            scanf("%d",&t);
            while(t--){
                cin>>anode.name>>anode.rp;
                q[i].push(anode);
            }
        }

        string cmd;
        int a,b,c;
        for(int i=1;i<=m;i++){
            cin>>cmd;
            if(cmd=="GETON"){
                cin>>a>>anode.name>>anode.rp;
                q[a].push(anode);
            }
            else if(cmd=="JOIN")            {
                scanf("%d %d",&a,&b);
                while(!q[b].empty())                {
                    q[a].push(q[b].top());
                    q[b].pop();
                }
            }
            else            {
                scanf("%d",&a);
                cout<<q[a].top().name<<endl;
                q[a].pop();
            }
        }
    }
    
    
    
    return 0;
}