题解 | #【模板】堆#

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

int main() {
    priority_queue<int, vector<int>, less<int> >q;
    int n;
    cin >> n;
    while (n--) { // 注意 while 处理多个 case
        string s;
        cin >> s;
        if(s=="push")
        {
            int x;
            cin >> x;
            q.push(x);
        }
        if(s=="top")
        {
            if(!q.empty())cout << q.top() << endl;
            else cout << "empty" << endl;
        }
        if(s=="pop")
        {
             if(!q.empty())
             {
                cout << q.top() << endl;
                q.pop();
             }
             else cout << "empty" << endl;
        }
    }
}
// 64 位输出请用 printf("%lld")