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>
#define Max 2000001

int A[Max];
int n = 0;

void Insert(int k){
  A[n] = k;
  n++;
}

int ExtractMax(void){
  int max = 0;
  int i;
  int j;
  int maxarray;
  for(i = 0;i < n;i++){
    if(max < A[i]){
      max = A[i];
      maxarray = i;
    }
  }
  for(j = maxarray;j < n;j++){
    A[j] = A[j+1];
  }
  n--;
  return max;
}

int main(){

  char command[10];
  int k;
  int i;

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

    if(command[0] == 'i'){
      scanf("%d",&k);
      Insert(k);
    }

    else if(command[1] == 'x'){
      printf("%d\n",ExtractMax());
      /*  for(i = 0;i < n;i++){
	printf("%d ",A[i]);
	printf("\n");
	}*/
    }

    else if(command[1] == 'n'){
      break;
    }
  }
  return 0;
}