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

int totonoe(int *,int);
int size=0;
int main(){
  int i,a[2000001],now,tmp;
  char c[8];
  while(1){
    scanf("%s",c);
    if(c[2] == 'd')
      break;
    if(c[0] == 'i'){
      scanf("%d",&now);
      size++;
      a[size] = now;
      for(now=size;now > 1;now/=2){
	if(a[now] > a[now/2]){
	  tmp = a[now];
	  a[now] = a[now/2];
	  a[now/2] = tmp;
	}else
	  break;
      }
    }else{
      printf("%d\n",a[1]);
      a[1]=a[size];
      size--;
      if(size > 1){
	for(i=size;i>1;i/=2)
	  totonoe(a,i/2);
      }
    }
    /*      printf("---%s---\n",c);
    for(i=1;i<size+1;i++){
      printf(" %d",a[i]);
    }
      printf("\n");
    
    */	
  }


}
int totonoe(int *a,int root){
  int tmp,b=1;
  if(size>=root*2)
    if(a[root*2]>a[root])
      b*=2;
  if(size>=root*2+1)
    if(a[root*2+1]>a[root])
      b*=3;
  if (b%2 == 0 && b%3 ==0){
    if(a[root*2]>a[root*2+1]){
      tmp=a[root*2];
      a[root*2] = a[root];
      a[root] = tmp;
      totonoe(a,root*2);
    }else{
      tmp=a[root*2+1];
      a[root*2+1] = a[root];
      a[root] = tmp;
      totonoe(a,root*2+1);
    }
    
  }else if(b%2 == 0){
      tmp=a[root*2];
      a[root*2] = a[root];
      a[root] = tmp;
      totonoe(a,root*2);


  }else if(b%3 ==0){
      tmp=a[root*2+1];
      a[root*2+1] = a[root];
      a[root] = tmp;
      totonoe(a,root*2+1);


  }
  return 0;
}