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: Accepted)

#include <stdio.h>

int h=0,aa[2000000000];

void mh(int i){
  int l,r,big,t;

  l = i*2;
  r = i*2 + 1;

  if(l<=h && aa[l]>aa[i])big = l;
  else big = i;
  if(r<=h && aa[r] > aa[big])big = r;

  if(big!=i){
    t=aa[i];
    aa[i]=aa[big];
    aa[big]=t;
    mh(big);
  }
}

/*
void bmh(void){
  int i;
  for(i=h/2;1<=i;i--){
    mh(i);
  }
}
*/

void in(int key){
  int t,tt;
  h++;
  tt=h;
  aa[h] = key;
  while(1<tt && aa[tt/2]<aa[tt]){
    t=aa[tt];
    aa[tt] = aa[tt/2];
    aa[tt/2] = t;
    tt = tt/2;
  }   
}

void ex(void){
  printf("%d\n",aa[1]);
  aa[1] = aa[h];
  h--;
  mh(1);
}
  

int main(){
  int i,key;
  char com[10];

  while(1){
    scanf("%s",com);
    if(com[2]=='d')break;

    if(com[0]=='i'){
      scanf("%d",&key);
      in(key);
    }
    else if(com[0]=='e'){
      ex();
    }
  }

  return 0;
}