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.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows;

namespace AOJ.Codes
{
    //問題の名称... ALDS1_9_C:   Heaps - PriorityQueue
    //問題文のURL... http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_9_C&lang=jp
    //所要時間... XXX
    //学んだこと... 単純なPriorityQueueの使い方を学ぶことができた。
    //教室内の大まかな着席位置... 中央 x 中央

    class Heaps
    {
        static void Main(string[] args)
        {
            //読み込み
            //計算
            var list = new List<int>();
            var ans = new List<int>();

            while (true)
            {

                var x = Console.ReadLine().Split().ToArray();
                if (x[0] == "end") //おわり
                {
                    break;
                }
                else if (x[0] == "extract") //extract
                {
                    list.Sort();
                    ans.Add(list[list.Count - 1]);
                    list.RemoveAt(list.Count-1);
                }
                else  //insert
                {
                    list.Add(int.Parse(x[1]));
                }
            }

            //出力
            foreach (var item in ans)
            {
                Console.WriteLine(item);
            }

            //Enterを押して終了
            Console.ReadLine();
        }


    }
}