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: Memory Limit Exceeded)

#include<stdio.h>

int que[2000000000];
int count=0;

void insert(int *que,int t,int i){
  if(que[0]==-1)que[0]=t;
  else {
    que[i]=t;
    for(;i>0;i--){
      if(que[i-1]<que[i]){
	que[i]=que[i-1];
	que[i-1]=t;
      }
    }
  }
}

void extractMax(int *que,int i){
  int j;
  printf("%d\n",que[0]);
  for(j=0;j<count;j++){
    que[j]=que[j+1];
  }
  que[j]=-1;
}
  

int main(){
  char *pp;
  int t;

  for(int i=0;i<2000000000;i++){
    que[i]=-1;
  }

  while(1){
    scanf(" %s",pp);

    if(pp[2]=='s'){
      scanf("%d",&t);
      insert(que,t,count);
      count++;
    }
    else if(pp[2]=='t'){
      extractMax(que,count);
    }
    else break;
  }
  return 0;
}