Envío 5406

Código

//
// Created by danie on 11/14/2021.
//

#include <iostream>
#include <vector>

#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL);

using namespace std;

void merge(vector<int> &list, int from, int half, int to){
    int firstHalf = half;
    int firstFrom = from;
    int mergedSize = (to - from) + 1;
    int mergedArray[mergedSize];
    for (int i = 0; i < mergedSize; i++){
        if((from < firstHalf + 1 && list[from] < list[half + 1]) || (half == to)){
            mergedArray[i] = list[from];
            from ++;
        } else{
            mergedArray[i] = list[half + 1];
            half ++;
        }
    }
    for (int i = 0; i < mergedSize; i++){
        list[firstFrom + i] = mergedArray[i];
    }
}

void __merge_sort(vector<int> &cards, int from, int to){
    if (from < to){
        int half = (to + from) / 2;
        __merge_sort(cards, from, half);
        __merge_sort(cards, half + 1, to);
        merge(cards, from, half, to);
    }
}

void merge_sort(vector<int> &cards){
    __merge_sort(cards, 0, cards.size() - 1);
}

//void test_merge_sort(){
//    vector<int> cards ={5,2,4,7,1,3,2,6};
//    merge_sort(cards);
//    for(int card : cards) cout<<card<<' ';
//}


int main(){
    fast_io
//    vector<int> cards = {0,1,43653,7437,3473,23,5,352,235};
//    radix_sort_non_negatives(cards);
    vector<int> cards;
    int n, in; cin>>n;
    for  (int i = 0; i < n; i++){
        cin>>in;
        cards.push_back(in);
    }
    merge_sort(cards);
    for(int num: cards) cout<<num<<' ';
}