Envío 2666

Código

#include <bits/stdc++.h>

#define fi first
#define se second
#define forn(i,n) for(int i=0; i< (int)n; ++i)
#define for1(i,n) for(int i=1; i<= (int)n; ++i)
#define fore(i,l,r) for(int i=(int)l; i<= (int)r; ++i)
#define ford(i,n) for(int i=(int)(n) - 1; i>= 0; --i)
#define fored(i,l,r) for(int i=(int)r; i>= (int)l; --i)
#define pb push_back
#define el '\n'
#define d(x) cout<< #x<< " " << x<<el
#define ri(n) scanf("%d",&n)
#define sz(v) ((int)v.size())
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()

using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> ii;
typedef pair<char,int> pci;
typedef tuple<int, int, int> tiii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;

const int inf = 1e9;
const int nax = 1e5+200;
const ld pi = acos(-1);
const ld eps= 1e-9;

int dr[] = {1,-1,0, 0,1,-1,-1, 1};
int dc[] = {0, 0,1,-1,1, 1,-1,-1};

void merge_sort(vi &a){
  if(sz(a)<=1) return ;
  int mid = (sz(a)-1)/2;
  vi left, right;
  forn(i,mid+1) left.pb(a[i]);
  fore(i,mid+1,sz(a)-1) right.pb(a[i]);
  merge_sort(left);
  merge_sort(right);
  a.clear();
  int i = 0, j = 0;
  while(i < sz(left) && j < sz(right)){
    if(left[i] < right[j]) a.pb(left[i++]);
    else a.pb(right[j++]);
  }
  if(j < sz(right)) swap(left, right), swap(i,j);
  while(i < sz(left)) a.pb(left[i++]);

}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  cout<< setprecision(20)<< fixed;
  int n;
  cin>> n;
  vi a(n);
  forn(i,n) cin>> a[i];
  merge_sort(a);
  forn(i,n) cout<< a[i]<< " ";
  cout<<el;
}