12.2 Насте

#include <iostream>
#include <vector>
using namespace std;

int num_v = 0;
vector <int> vec;

void heapify(int i) { // приводим пирамиду к правильному виду
    int greatestChild = i;
    while (1) {
        int element = 2 * i + 1;
        if (element < num_v && vec[element] > vec[greatestChild])
            greatestChild = element;
        element++;
        if (element < num_v && vec[element] > vec[greatestChild])
            greatestChild = element;
        if (greatestChild == i)
            break;
        swap(vec[greatestChild], vec[i]);
        i = greatestChild;

    }
}


void addValue(int number) {
    vec.push_back(number);
    int actual = 0, p = 0;
    actual = num_v;
    p = (actual - 1) / 2;
    while (actual > 0 && vec[actual] > vec[p]) {
        swap(vec[actual], vec[p]);
        actual = p;
        p = (actual - 1) / 2;
    }
}


void bigHeapify() {
    for (int i = num_v / 2; i >= 0; i--)
        heapify(i);
    heapify(0);
}

int popMax() {
    int answer = vec[0];

    num_v-=1;
    vec[0] = vec[num_v];
    vec.erase(vec.end() - 1);
    bigHeapify();
    return answer;
}

int main() {
    int k;
    cin >> k;
    for (int i = 0; i < k; i++) {
        int a;
        cin >> a;
        if (a == 1) {
            int answer = popMax();
            cout << answer << endl;
        }
        else {
            int input;
            cin >> input;
            addValue(input);
            num_v++;
        }
    }
    return 0;
}