Envío 5432

Código

/// Write by Daniel Perez .PERAPRO
#include<bits/stdc++.h>

using namespace std;
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(), s.end()
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
char el = '\n';
char esp = ' ';

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ostream& operator<<(ostream& os, const vector<int> &v){
    for(auto const &i: v){
        os<<i<<" ";
    }
    os<<'\n';
    return os;
}
string yes="YES";
string no="NO";

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int partition(vi &v, int p, int r){
    int x = v[r];
    int i = p - 1;
    for(int j = p;j<=r - 1;j++){
        if(v[j] <= x){
            i = i + 1;
            swap(v[i], v[j]);
        }
    }
    swap(v[i + 1], v[r]);
    return i + 1;
}

int random_p(vi &v, int p, int r){
    int i = uniform_int_distribution<int>(p, r)(rng);
    swap(v[r], v[i]);
    return partition(v, p, r);
}

void quicksort(vi &v, int p, int r){
    if(p < r){
        int q = random_p(v, p, r);
        quicksort(v, p,q - 1);
        quicksort(v, q + 1,r);
    }
}

int main(){
	fast_io;
	/*
 	freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    */
    
    int n;
    cin>>n;
    vi v(n);
    for(int &e:v)
        cin>>e;
        
    shuffle(all(v), rng);
    quicksort(v, 0,n - 1);
    cout<<v;
}

/*

*/