int l, r, largest;

l = 2 * i;

r = 2 * i + 1;

// 从左子结点，自身，右子结点中选出值最大的结点

if (1 <= H && A[l] > A[i]) largest = l;

else largest = i;

if (r <= H && A[r] > A[largest]) largest = r;

if (largest != i) {

swap(A[i], A[largest]);

maxHeapify(largest);

}

int maxv;

if (H < 1) return -INFTY;

maxv = A[1];

A[1] = A[H--];

maxHeapify(1);

return maxv;

if (key < A[i]) return;

A[i] = key;

while (i > 1 && A[i / 2] < A[i]) {

swap(A[i], A[i / 2]);

i = i / 2;

}

H++;

A[H] = -INFTY;

increaseKey(H, key);

int key;

char com[10];

while (1) {

scanf("%s", com);

if (com[0] == 'e' && com[1] == 'n') break;

if (com[0] == 'i') {

scanf("%d", &key);

insert(key);

} else {

printf("%d\n", extract());

}

}

return 0;

}