681C - Heap Operations - CodeForces Solution

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


typedef  long long int   ll;


int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll test,h,p,i,j,s,xy,n,flag=0,u,count,d,o1=0,o2=0,e,l,r,x,y,m,z,max1,x1,y1,k,x2,y2,z1,z2,sum,min1;
vector<pair<string,ll>>ans;
cin>>n;
priority_queue<ll,vector<ll>,greater<>>mk;
for(i=0;i<n;i++){
    string a;
    cin>>a;
    x=0;
    if(a[0]=='i'){
        cin>>x;
        ans.push_back({a,x});
        mk.push(x);
    }else{
        if(a[0]=='g'){
            cin>>x;
            while(mk.size()&&x>mk.top()){
                ans.push_back({"removeMin",0});
                mk.pop();
            }
            if(mk.size()==0||mk.top()>x){
                ans.push_back({"insert",x});
                mk.push(x);
            }
            ans.push_back({a,x});
        }else{
            if(mk.size()==0){
                ans.push_back({"insert",1});
                mk.push(1);
            }
            ans.push_back({a,0});
            mk.pop();
        }
    }
}
cout<<ans.size()<<"\n";
for(auto dd:ans){
    cout<<dd.first<<" ";
    if(dd.first[0]!='r'){
        cout<<dd.second<<" ";
    }
    cout<<"\n";
}
return 0;
}