Envío 1922

Código

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <set>
#include <list>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>
#define forn(a, n) for(int a = 0; a<(int) (n); ++a)
#define rforn(a, n) for(int a = (n)-1; a>=0; --a)
using namespace std;
const int N = 6e5+20;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n, pos, temp, este;
    cin>>n;
    //int a [1001];
    vector <int> a;
    for(int i = 0; i < n; i++)
    {
        //cin>>a[i];
        cin>>este;
        a.push_back(este);
    }
    sort(a.begin(), a.end());
    //antes de empezar, quiero ver si coge la trampa
    // --- QUICK SORT --- -> XXX
    /*
    for(int i = 0; i < n-1; i++)
    {
        int min = N;
        for(int j = i; j < n; j++)
        {
            if(a[j] < min)
            {
                min = a[j];
                pos = j;
            }
        }
        if(min != N)
        {
            temp = a[i];
            a[i] = a[pos];
            a[pos] = temp;
        }
    }
    */

    // --- MERGE SORT --- -> XXX
    

    for(int i = 0; i < n; i++)
    {
        cout<<a[i]<<" ";
    }
    cout<<endl;
}