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<stdlib.h>
int R=1,C=1,HB[2000010]={0};
int N[2000010]={2100000000};
void H(int a){
  int i=C++;
  for(N[R]=a;a>N[HB[i/2]];i/=2)HB[i]=HB[i/2];
  HB[i]=R++;
}
int h(){
  int rt=HB[1],nt=1,i=0,k=HB[--C];
  while(nt-i){
    HB[i=nt]=k;
    if(i*2  <C&&N[  k  ]<N[HB[i*2  ]])HB[i]=HB[nt=i*2  ];
    if(i*2+1<C&&N[HB[nt]]<N[HB[i*2+1]])HB[i]=HB[nt=i*2+1];
  }
  return rt;
}
void prih(){
  int i,j=0;
  for(i=0;i<C;i++){
    if(i==1<<j){
      printf("\n");
      j++;
    }
    printf("%d ",N[HB[i]]);
  }
  printf("\n");
}
int main(){
  int a;
  char s[1000];
  while(scanf("%s",s),s[2]-'d'){
    if(s[0]=='i'){
      scanf("%d",&a);
      H(a);
    }
    else printf("%d\n",N[h()]);
  }    
  return 0;
}