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: Runtime Error)

#include<stdio.h>
#include<string.h>
#define maxH 500001


void maxHeapify(int A[],int i,int H){
	int l=i*2;
	int r=l+1;
	int largest;
	
	if(l<=H && A[l]>A[i])largest=l;
	else largest=i;
	
	if(r<=H && A[r]>A[largest])largest=r;
	
	if(largest!=i){
		int temp=A[i];
		A[i]=A[largest];
		A[largest]=temp;
		maxHeapify(A,largest,H);
	}
}

void buildMaxHeap(int A[],int H){
	int i;
	for(i=H/2;i>0;i--)maxHeapify(A,i,H);
}

int main(void){
	int A[maxH];
	int cnt=0;
	int key;
	int sort=0;
	char cmd[10];
	
	while(1){
		scanf("%s",cmd);
		if(!strcmp(cmd,"insert")){
			scanf("%d",&key);
			A[cnt+1]=key;
			cnt++;
			sort=-1;
		}else if(!strcmp(cmd,"extract")){
			if(sort==-1){
				buildMaxHeap(A,cnt);
				sort=1;
			}
			printf("%d\n",A[1]);
			A[1]=0;
			maxHeapify(A,1,cnt);
		}else{
			break;
		}
	}
	return 0;
}