Envío 6761

Código

#include <bits/stdc++.h>
#include <queue>
#define REP(i,n) for(int i=0; i<n;i++)
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define lli long long int
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
ostream& operator<<(ostream& os, const vector<int> &v){
    for(auto const &i: v){
        os<<i<<" ";
    }
    os<<endl;
    return os;
}
struct comp{
  bool operator()(pair<int,string> &a, pair<int,string> &b){
    if(a.ff < b.ff)return true;
    if(a.ff > b.ff)return false;
    else{
      if(a.ss >= b.ss)return true;
      else return false;
    }
  }
};
const lli mod=(1e9)+7;
const int N = 1e4+1;
int main(){
    fast_io;
    priority_queue<pair<int,string>, vector<pair<int,string>>,comp> pq;
    int n;cin>>n;
    REP(i,n){
      string ins;
      cin>>ins;
      if(ins == "Insert"){
        string x;
        int p;
        cin>>x>>p;
        pq.push(pair<int,string>(p,x));
      }
      else if(ins == "GetMax"){
        auto cur = pq.top();
        cout<<cur.ss<<endl;
      }
      else{
        pq.pop();
      }
    }
    return 0;
}