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: Accepted)

#include<stdio.h>
#define MAX 2000000
#define MAX2 99999999

int h,data[MAX+1];
int left(int l){
  return 2*l;
}
int right(int r){
  return 2*r+1;
}
void maxHeapify(int i){
  int l,r,largest,t;
  l=left(i);
  r=right(i);
  if(l<=h && data[l]>data[i])largest=l;
  else largest=i;
  if(r<=h && data[r]>data[largest])largest=r;
  if(largest!=i){
    t=data[i];
    data[i]=data[largest];
    data[largest]=t;
    maxHeapify(largest);
  }
}
int alg(){
    int max;
    if(h<1)return -MAX2;
    max=data[1];
    data[1]=data[h--];
    maxHeapify(1);
    return max;
}
void increase(int i,int key){
    int t;
    if(key<data[i])return;
    data[i]=key;
    while(data[i/2]<data[i]&&i>1){
        t=data[i];
        data[i]=data[i/2];
        data[i/2]=t;
        i=i/2;
    }
}
void insert(int x){
    h++;
    data[h]=-MAX2;
    increase(h,x);
}
int main(){
    int x;
    char s[10];
    while(1){
        scanf("%s",s);
        if(s[1]=='n' && s[0]=='e')break;
        if(s[0]=='i'){
            scanf("%d",&x);
            insert(x);
        }else{
            printf("%d\n",alg());
        }
    }
    return 0;
}