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>
#define SIZE 5000001

int A[SIZE],B[SIZE],c = 1;

void maxheap(int H,int i){
  int l,r,largest;

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

  if (l <= H && A[l] > A[i]) largest = l;
  else largest = i;

  if(r <= H && A[r] > A[largest]) largest = r;

  if(largest != i){
    l = A[i];
    A[i] = A[largest];
    A[largest] = l;
    maxheap(H,largest);
  }
}

void build(int H){
  int i;
  for(i = H/2;i > 0;i--) maxheap(H,i);
}

void extract(int H){
  B[c] = A[1];
  c++;
  A[1] = A[H];
  maxheap(H--,1);
  }

  void insert(int H){
    int v;
    if(H/2 > 0){
      if(A[H] > A[H/2]){
        v = A[H];
        A[H] = A[H/2];
        A[H/2] = v;
        insert(H/2);
      }
      else return;
    }
  else return;
  }

  int main(){
    int n,i = 0;
    char str[20];

    while(1){
      scanf("%s",&str);
      if(str[0] == 'i'){
        i++;
        scanf("%d",&A[i]);
        insert(i);
      }
      else if(str[1] == 'x'){
        extract(i);
        i--;
      }
      else{
          for(n = 1;n < c;n++){
            printf("%d\n",B[n]);
          }
          break;
        }
    }


    return 0;
  }