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: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int A[200000000], heap_size=0;
void maxHeapify(int i){
  int l, r, max, cp;
  l = 2*i;
  r = 2*i+1;
  if(l <= heap_size && A[l] > A[i])
    max = l;
  else max = i;
  if(r <= heap_size && A[r] > A[max])
    max = r;
  if(max != i){
    cp = A[i];
    A[i] = A[max];
    A[max] = cp;
    maxHeapify(max);
  }
  return;
}
int extract(){
  int max;
  max = A[1];
  A[1] = A[heap_size];
  heap_size--;
  maxHeapify(1);
  return max;
}
void heapIncreaseKey(int i, int key){
  int ch;
  A[i] = key;
  while(i > 1 && A[i/2] < A[i]){
    ch = A[i];
    A[i] = A[i/2];
    A[i/2] = ch;
    i = i/2;
  }
  return;
}
void insert(int key){
  heap_size = heap_size+1;
  heapIncreaseKey(heap_size, key);
  return;
}
int main(){
  int key, max;
  char s[10];
  while(1){
    scanf("%s",s);
    if(s[0] == 'i'){
      scanf("%d",&key);
      heap_size++;
      insert(key);
    }
    else if(s[1] == 'x'){
      max = extract();
      printf("%d\n",max);
    }
    else if(s[0] == 'e')
      break;
  }
  return 0;
}