Codeforces Round #357 (Div. 2) - C - Heap Operations

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<queue>
using namespace std;

priority_queue<int,vector<int>,greater<int> > q;

const int maxn = 100010;
int ins[maxn],re[maxn],op[maxn];
char str[maxn][20];
int main()
{
    int n;
    while(!q.empty()) q.pop();
    scanf("%d",&n);
    int cnt = n,cr=0;
    for(int i=0;i<n;i++){
        scanf("%s",str[i]);
        if( strcmp(str[i],"removeMin") != 0 )
            scanf("%d",&op[i]);             
        if(strcmp(str[i],"insert") == 0){
            q.push(op[i]);
        }
        if(strcmp(str[i],"removeMin")==0){
            if(q.empty()){                
                op[i] = 0;
                ins[i] = 1; cnt++;
            }
            else q.pop();
        }
        if(strcmp(str[i], "getMin") == 0){
            if(!q.empty()){
                if(q.top() < op[i]){
                    while((q.top() < op[i]) && (!q.empty()) ){                
                        re[i] ++; cnt ++;
                        q.pop(); 
                    }
                    if(q.top() != op[i] ) {
                        q.push(op[i]); cnt++;
                        ins[i] = 1;
                    }                 
                }                
                if(q.top() > op[i]){
                    q.push(op[i]);
                    ins[i] = 1; cnt ++;
                }
            }
            else {
                q.push(op[i]);
                ins[i] = 1; cnt ++;
            }            
        }        
    }
    cout<<cnt<<endl;
    for(int i=0;i<n;i++){
        if(ins[i]) printf("insert %d\n",op[i]);
        if(re[i])
            for(int j=0;j<re[i];j++) printf("removeMin\n");
        if(strcmp(str[i], "removeMin") != 0)
            printf("%s %d\n",str[i],op[i]);
        else printf("%s\n",str[i]);
    }
    return 0; 
}