Envío 1513

Código

#include <iostream>
#include <vector>
using namespace std;
void merge(vector<int> &nums, int left, int right) {
  int mid = left + (right - left) / 2;
  int n1 = mid - left + 1;
  int n2 = right - mid;

  vector<int> leftE(n1);
  vector<int> rightE(n2);
  for (int i = 0; i < n1; i++) leftE[i] = nums[left + i];
  for (int j = 0; j < n2; j++) rightE[j] = nums[mid + 1 + j];

  int i = 0;
  int j = 0;
  int k = left;
  while (i < n1 && j < n2) {
    if (leftE[i] <= rightE[j]) {
      nums[k] = leftE[i];
      i++;
    } else {
      nums[k] = rightE[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    nums[k] = leftE[i];
    i++;
    k++;
  }
  while (j < n2) {
    nums[k] = rightE[j];
    j++;
    k++;
  }
}

void sort(vector<int> &nums, int left, int right) {
  if (left >= right) {
    return;
  }
  int mid = left + (right - left) / 2;
  sort(nums, left, mid);
  sort(nums, mid + 1, right);
  merge(nums, left, right);
}

int main() {
  int n;
  cin >> n;
  vector<int> nums(n);
  for (int i = 0; i < n; ++i) {
    cin >> nums[i];
  }
  sort(nums, 0, n - 1);
  for (auto num : nums) {
    cout << num << " ";
  }
  cout << endl;
  return 0;
}