HDU 1873 优先队列 Java版

Problem - 1873 (hdu.edu.cn)https://acm.hdu.edu.cn/showproblem.php?pid=1873

创建了三个优先队列，分别代表三个医生，优先队列里添加的元素是病人

算法思路是：当输入“IN A B”时，就往A医生的队列里添加该病人，当输入“OUT A”时，就在医生A的队列里取出第一个元素。

优先队列中的规则是：让级别高的病人排在前列，如果两个病人级别一样，那么ID小的（意味着这个病人先来）的病人排在前面。

import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {


    public static void main(String[] args) {
        new Main().solve();
    }

    static Comparator<Patient> cPatient = new Comparator<Patient>() {
        @Override
        public int compare(Patient o1, Patient o2) {
            if (o1.level != o2.level) {
                return o2.level - o1.level;
            }
            return o1.id - o2.id;
        }
    };

    public void solve() {
        PriorityQueue[] queue = new PriorityQueue[3];
        int T, doctorId, patientLevel;
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            T = in.nextInt();
            queue[0] = new PriorityQueue<>(cPatient);
            queue[1] = new PriorityQueue<>(cPatient);
            queue[2] = new PriorityQueue<>(cPatient);
            int id = 1;
            while ((T--) != 0) {
                String op = in.next();
                if ("IN".equals(op)){
                    doctorId = in.nextInt();
                    patientLevel = in.nextInt();
                    queue[doctorId-1].add(new Patient(id++,patientLevel));

                }else {
                    doctorId = in.nextInt();
                    if (!queue[doctorId-1].isEmpty()){
                        Patient patient = (Patient) queue[doctorId - 1].poll();
                        System.out.println(patient.id);
                    }else {
                        System.out.println("EMPTY");
                    }
                }
            }
        }
    }

}

class Patient {
    int id;//编号
    int level;//等级

    public Patient(int id, int level) {
        this.id = id;
        this.level = level;
    }
}