AC啦！！！

#include <bits/stdc++.h>
#define Rep(x, a, b) for (int x = a; x <= b; x++)
#define Dep(x, a, b) for (int x = a; x >= b; x--)
using namespace std;
priority_queue<int, vector<int>, less<int> > que;
int main()
{
    int n, x;
    cin >> n;
    Rep(i, 1, n)
    {
        int op;
        cin >> op >> x;
        if (op == 1)
            que.push(x);
        else if (op == 2)
            cout << que.top() << endl;
        else
            que.pop();
    }
    return 0;
}