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: Time Limit Exceeded)

#include <stdio.h>

int main(void){
    int max=-1,S[2000000];
    char command[10];
    while(scanf("%s",command)!=EOF){
        if(command[2]=='d') break;
        else if(command[2]=='s'){
            int k;
            scanf("%d",&k);
            if(max==-1) S[++max]=k;
            else{
                int p=++max;
                while(p>0 && S[p-1]>k){
                    S[p]=S[p-1];
                    p--;
                }
                S[p]=k;
            }
        }
        else if(command[2]=='t'){
            printf("%d\n",S[max]);
            S[max--]=-1;
        }
    }
    return 0;
}