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 INF 99999999

void maxHeapipy(int);
void insert(int);
void increase(int,int);
int extract(void);

int S[200000000],H;

void maxHeapipy(int i)
{
  int left,right,max,a; /* aは交換用 */

  left = i*2;
  right = i*2+1;

  if(left <= H && S[left] > S[i]) {
    max = left;
  }else{
    max = i;
  }

  if(right <=H && S[right] > S[max])
    max = right;

  if(max != i) {
    a = S[i];
    S[i] = S[max];
    S[max] = a;
    maxHeapipy(max);
  }
}

void insert(int k)
{
  H++;
  S[H] = -INF;
  increase(H,k);
}

void increase(int i,int k)
{
  int t;
  
  if(k < S[i])
    return;
  S[H] = k;
  while(i > 1 && S[i/2] < S[i]) {
    t = S[i];
    S[i] = S[i/2];
    S[i/2] = t;
    i = i/2;
  }
}
    
    
int extract()
 {
   int maxim;
   if(H < 1)
     return -INF;
   maxim = S[1];
   S[1] = S[H--];
   maxHeapipy(1);
   return maxim;
 }

   
int main()
{
  int k;
  char mei[10];

  while(1){
    scanf("%s",mei);
    if(mei[0] == 'e' && mei[1] == 'n')
      break;
    if(mei[0] == 'i') {
      scanf("%d",&k);
      insert(k);
    }else{
      printf("%d\n",extract());
    }
  }

  return 0;
}