Envío 5349

Código

import random

def merge(p,q,r):
   global A
   n1 = q - p + 1
   n2 = r - q
   L=[]
   R=[]
   for i in range(n1):
      L.append(A[p + i])
   for j in range(n2):
      R.append(A[q + j + 1])
   L.append(1000000000)
   R.append(1000000000)
   i=0
   j=0
   for k in range(p,r + 1):
      if L[i] <= R[j]:
         A[k] = L[i]
         i += 1
      else:
         A[k] = R[j]
         j += 1
           
def mergeSort(p,r):
   if p < r:
      q = int((p + r) / 2)
      mergeSort(p,q)
      mergeSort(q+1,r)
      merge(p,q,r)
      
n = int(input())
A = [int(x) for x in input().split()]
#print(A)
mergeSort(0, n - 1)

for i in range(len(A)):
    print(A[i], end = " ")