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 JavaScript (judge verdict: Wrong Answer)

//config = { input: 'tmp', newline: '\r\n' }; // win
config = { input: '/dev/stdin', newline: '\n' }; // linux

s = require('fs').createReadStream(config.input, {encoding: 'ascii'});
rl = require('readline').createInterface({input: s, output: process.stdout});
rl.on('line', onRead);
rl.on('end', function () { s.close(); });

const MAXSIZE = 2000000;
const MIN = -1;
h/*eap*/ = new Array(MAXSIZE+1);
s/*ize*/ = 0;
for (i = 0; i <= MAXSIZE; i++) h[i] = MIN;

function maxHeapify(A, i) {
  var l, r, largest, tmp;
  l = i * 2;
  r = i * 2 + i;
  if (l <= s && A[l] > A[i]) largest = l;
  else largest = i;
  if (r <= s && A[r] > A[largest])
    largest = r;
  if (largest !== i) {
    tmp = A[largest];
    A[largest] = A[i];
    A[i] = tmp;
    maxHeapify(A, largest);
  }
}

function heapExtractMax(A) {
  var max;
  if (s < 1) {
    console.error("???????????¢??????????????????");
    process.exit();
  }
  max = A[1];
  A[1] = A[s];
  s--;
  maxHeapify(A, 1);
  return max;
}

function heapIncreaseKey(A, i, key) {
  var parent, tmp;
  if (key < A[i]) {
    console.error("??°????????????????????¨????????????????°???????");
    process.exit(1);
  }
  A[i] = key;
  while (i > 1) {
    parent = Math.floor(i / 2);
    if (A[parent] >= A[i]) return;
    tmp = A[parent];
    A[parent] = A[i];
    A[i] = tmp;
    i = parent;
  }
}

function maxHeapInsert(A, key) {
  s++;
  A[s] = MIN;
  heapIncreaseKey(A, s, key);
}

function print() {
  console.log(h.slice(1, s + 1));
}

function onRead(line) {
  if (line === 'end') {
    rl.close();
  } else if (line === 'extract') {
    console.log(heapExtractMax(h));
  } else {
    maxHeapInsert(h, parseInt(line.split(' ')[1]));
  }
}