原题http://acm.hdu.edu.cn/showproblem.php?pid=1873

看病要排队

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4774    Accepted Submission(s): 1976

7
IN 1 1
IN 1 2
OUT 1
OUT 2
IN 2 1
OUT 2
OUT 1
2
IN 1 1
OUT 1

2
EMPTY
3
1
1

//开了三个优先队列。每一个代表一个医生。
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <limits.h>
#include <ctype.h>
#include <string.h>
#include <string>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;

struct node1{
    int sum;
    int id;
    friend bool operator < (node1 a,node1 b){
        if(a.sum == b.sum){
            return a.id > b.id;
        }
        return a.sum < b.sum;
    }
};

struct node2{
    int sum;
    int id;
    friend bool operator < (node2 a,node2 b){
        if(a.sum == b.sum){
            return a.id > b.id;
        }
        return a.sum < b.sum;
    }
};

struct node3{
    int sum;
    int id;
    friend bool operator < (node3 a,node3 b){
        if(a.sum == b.sum){
            return a.id > b.id;
        }
        return a.sum < b.sum;
    }
};

int main(){
    char a[10];
    int n,A,B,C;
    struct node1 p1,p11;
    struct node2 p2,p22;
    struct node3 p3,p33;

    while(~scanf("%d",&n)){
        int count = 1;
        priority_queue<node1>q1;
        priority_queue<node2>q2;
        priority_queue<node3>q3;
        while(n--){
            scanf("%s",a);
            if(a[0] == 'I'){
                scanf("%d%d",&A,&B);
                if(A == 1){
                    p1.id = count;
                    p1.sum = B;
                    q1.push(p1);
                }
                if(A == 2){
                    p2.id = count;
                    p2.sum = B;
                    q2.push(p2);
                }
                if(A == 3){
                    p3.id = count;
                    p3.sum = B;
                    q3.push(p3);
                }
                count++;
            }
            else{
                scanf("%d",&C);
                if(C == 1){
                    if(!q1.empty()){
                        p11 = q1.top();
                        q1.pop();
                        printf("%d\n",p11.id);
                    }
                    else{
                        printf("EMPTY\n");
                    }
                }
                if(C == 2){
                    if(!q2.empty()){
                        p22 = q2.top();
                        q2.pop();
                        printf("%d\n",p22.id);
                    }
                    else{
                        printf("EMPTY\n");
                    }
                }
                if(C == 3){
                    if(!q3.empty()){
                        p33 = q3.top();
                        q3.pop();
                        printf("%d\n",p33.id);
                    }
                    else{
                        printf("EMPTY\n");
                    }
                }
            }
        }
    }

    return 0;
}

STL 优先队列

原文：http://blog.csdn.net/zcr_7/article/details/39007499