Envío 1308

Código

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

void sort(vector<int> &head, int index, int size) {
  if (size < 2) {
    return;
  }
  int middle = size / 2;
  sort(head, index, middle);
  sort(head, index + middle, size - middle);
  int firstIndex = index;
  int secondIndex = index + middle;
  vector<int> sorted(size);
  for (int i = 0; i < size; ++i) {
    if ((head[firstIndex] < head[secondIndex] and
         firstIndex < index + middle) or
        secondIndex - index - middle == size - middle) {
      sorted[i] = head[firstIndex++];
    } else {
      sorted[i] = head[secondIndex++];
    }
  }
  for (int i = 0; i <  size; ++i) {
    head[index + i] = sorted[i];
  }
}

int main() {
  int N;
  cin >> N;
  vector<int> v;
  for (int i = 0; i < N; ++i) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  sort(v, 0, N);
  for (auto x : v) {
    cout << x << " ";
  }
  cout << endl;
}