优先队列模板

#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;priority_queue<int> q;int m,opt,x;int main(){    scanf("%d",&m);    while(m--){        scanf("%d",&opt);        if(opt==1) scanf("%d",&x),q.push(-x);        else if(opt==3) q.pop();        else printf("%d\n",-q.top());    }}