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>
#define maxN 2000000

static int a[maxN+1],N;
void insert(int v){
  a[++N]=v;
}
int rem(){
  int j,max,v;
  max=1;
  for(j=2;j<=N;j++)
    if(a[j]>a[max])
      max=j;
  v=a[max];
  a[max]=a[N--];
  return v;
  }
int main(void){
  char com[10];
  int v,i=0,j=0,b[maxN];
  while(1){
    scanf("%s",com); 
    if(com[0]=='i'){
      scanf("%d",&v);
      insert(v);
    }
    else
      if(com[1]=='x'){
	b[i]=rem();
	i++;
      }
      else
	break;
  }
  for(j=0;j<i;j++)
     printf("%d\n",b[j]);
  return 0;
}