HIHO #1105 : 题外话·堆

题目链接
偷懒直接使用优先队列

#include<bits/stdc++.h>using namespace std;#define cl(a,b) memset(a,b,sizeof(a))#define LL long long#define pb push_back#define gcd __gcd#define For(i,j,k) for(int i=(j);i<k;i++)#define lowbit(i) (i&(-i))#define _(x) printf("%d\n",x)const int maxn = 1e6+10;const int inf  = 1 << 28;priority_queue<int> q;int main(){    int n;scanf("%d",&n);    for(int i=0;i<n;i++){        string a;        int b;        cin>>a;        if(a=="T"){            cout<<q.top()<<endl;            q.pop();            continue;        }        cin>>b;        q.push(b);    }    return 0;}