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)

using System;
using System.Collections.Generic;
using System.Text;

class Program
{

    public void Proc()
    {
        this.Que = new long[0];
        for (int i = 0; i < 2000000; i++)
        {
            string[] inpt = Console.ReadLine().Split(' ');
            if (inpt[0].Equals("insert"))
            {
                long newNum = long.Parse(inpt[1]);
                this.Insert(newNum);
            }
            else if (inpt[0].Equals("extract"))
            {
                Console.WriteLine(this.Extract());
            }
            else
            {
                break;
            }
        }
    }

    private long[] Que;

    private void Insert(long newNum) {
        long[] tmp = new long[this.Que.Length + 1];

        int idx = 0;
        for(int i=0; i<tmp.Length; i++) {
            if(idx >= this.Que.Length) {
                tmp[i] = newNum;
                break;
            }
            if (this.Que[idx] > newNum)
            {
                tmp[i] = newNum;
                newNum = long.MaxValue;
            }
            else
            {
                tmp[i] = this.Que[idx];
                idx++;
            }
        }
        this.Que = tmp;
    }

    private long Extract() {
        long[] tmp = new long[this.Que.Length-1];
        long ret = this.Que[this.Que.Length-1];
        for(int i=0; i<tmp.Length; i++) {
            tmp[i] = this.Que[i];
        }
        this.Que = tmp;
        return ret;
    }

    static void Main(string[] args)
    {
        Program prg = new Program();
        prg.Proc();
    }
}