Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Priority Queue

A priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:

$insert(S, k)$: insert an element $k$ into the set $S$

$extractMax(S)$: remove and return the element of $S$ with the largest key

Write a program which performs the $insert(S, k)$ and $extractMax(S)$ operations to a priority queue $S$.
The priority queue manages a set of integers, which are also keys for the priority.

Input

Multiple operations to the priority queue $S$ are given. Each operation is given by "insert $k$", "extract" or "end" in a line. Here, $k$ represents an integer element to be inserted to the priority queue.

The input ends with "end" operation.

Output

For each "extract" operation, print the element extracted from the priority queue $S$ in a line.

Constraints

The number of operations $\leq 2,000,000$

$0 \leq k \leq 2,000,000,000$

Sample Input 1

insert 8
insert 2
extract
insert 10
extract
insert 11
extract
extract
end

Sample Output 1

8
10
11
2

Solution in C (judge verdict: Time Limit Exceeded)

#include <stdio.h>
#include <string.h>
 
#define comMAX 2000000
#define comLEN 7
 
void heapify(int s[],int h,int i){
    int l,r,max,tmp;
    l=i<<1;
    r=(i<<1)+1;
    max=i;
 
    if(l<=h&&s[l-1]>s[max-1])max=l;
    if(r<=h&&s[r-1]>s[max-1])max=r;
     
    if(max!=i){
        tmp=s[max-1];
        s[max-1]=s[i-1];
        s[i-1]=tmp;
         
        heapify(s,h,max);
    }
     
    return;
}
 
void output(int s[],int h){
    int i;
    for(i=0;i<h;i++)printf("%d ",s[i]);
    printf("\n");
}
 
int main(void){
    int i;
     
    int s[comMAX];
    int l=0;
    char com[comLEN+1];
    int x;
    while(1){
        scanf("%s \n",com);
        if(com[0]=='i'){
            scanf("%d\n",&x);
            s[l++]=x;
            for(i=l>>1;i>0;i--)heapify(s,l,i);
        }else if(com[1]=='x'){
            printf("%d\n",s[0]);
            s[0]=s[--l];
            heapify(s,l,1);
        }else if(com[1]=='n')break;
        else break;
    }
     
//    output(s,l);
     
    return 0;    
}