最小值堆实现一个优先队列.利用优先队列存入所有病人的信息（编号和病情严重程度）。最后利用优先队列获得病人看病的次序。 -Minimum heap to implement a priority queue. Use the priority queue information stored in all patients (number and severity of the disease.) Finally, priority queue order to obtain the patient to see a doctor.