洛谷链接:https://www.luogu.com.cn/problem/P3378
洛谷对java非常不友好,这题只拿了70分
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
static PriorityQueue<Integer> minHeap=new PriorityQueue<>();
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
while(n!=0) {
int a=in.nextInt();
if(a==1) {
int b=in.nextInt();
minHeap.offer(b);
}else if(a==2) {
System.out.println(minHeap.peek());
}else if(a==3) {
minHeap.poll();
}
n--;
}
}
}