题解 | 【模板】整数优先队列

#include<bits/stdc++.h>
using namespace std;

int n,op,x; 

int main(){
	
	priority_queue<int,vector<int>,greater<int>> pr;
	
	cin>>n;
	
	for(int i=1;i<=n;i++){
		cin>>op;
		
		if(op==1){
			scanf("%d",&x);
			pr.push(x);
		}else if(op==2){
			printf("%d\n",pr.top());
		}else if(op==3){
			pr.pop();
		}
	}

    return 0;
}