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 <stdlib.h>
#include <string.h>

int main(){

  int A[2000000], i, cnt= 0, Max = 0, c = 0, Max2=0;
  char C[8];

  while(scanf("%s", C)==1){
    if(C[0] == 'i'){
      scanf("%d", &A[cnt]);
      if(Max < A[cnt]) Max = A[cnt];
      cnt++;
    }
    else if(strncmp(C, "ex", 2) == 0){
      printf("%d\n", Max);
      for(i=0; i<cnt; i++){
        if(Max2 < A[i] && A[i] < Max){
          Max2 = A[i];
        }
        if(A[i]==Max && c == 0){
          A[i] = A[i+1];
          c = 1;
        }
        else if(c == 1){
          if(Max2 < A[i] ){
            Max2 = A[i];
          }
          A[i] = A[i+1];
        }
      }
      Max = Max2;
      Max2 = 0;
      c = 0;
      cnt--;
    }
    else break;
  }


return 0;
}