Envío 2340

Código

#include<bits/stdc++.h>
using namespace std;

int left(int val){
    return val<<1;
}

int right(int val){
    return (val<<1)+1;
}

int dad(int val){ return val>>1;}

void down(int from,vector<int> &arr){
    int next = from;
    int sz = arr.size();
    if(left(from) < sz && arr[left(from)] < arr[next])
        next = left(from);
    if(right(from) < sz && arr[right(from)] < arr[next])
        next = right(from);
    swap(arr[next],arr[from]);
    if(from != next)
        down(next,arr);
}

void up(int from, vector<int> &arr){
    while(from != 1 && arr[dad(from)] > arr[from]){
        swap(arr[dad(from)],arr[from]);
        from = dad(from);
    }
}

int top(vector<int> &arr){
    return arr[1];
}

void add(vector<int> &arr, int val){
    arr.push_back(val);
    up(arr.size()-1,arr);
}

void pop(vector<int> &arr){
    swap(arr[1],arr.back());
    arr.pop_back();
    if(arr.size() > 1)
        down(1,arr);
}

int main(){
    int n;
    scanf(" %d",&n);
    vector<int> nums = {0};
    for(int i = 0; i < n;++i){
        int val;
        scanf(" %d",&val);
        add(nums,val);
    }
    int first = 0;
    while(nums.size() > 1){
        if(first) printf(" ");
        printf("%d",top(nums));
        pop(nums);
        first = 1;
    }
    puts("");
    return 0;
}