Envío 4761

Código

def mergesort(arr, l, r):
    if l == r:
        return [arr[l]]
    if l > r:
        return []
    m = (l + r) >> 1
    res = []
    left = mergesort(arr, l, m)
    right = mergesort(arr, m + 1, r)
    i = j = 0
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            res.append(left[i])
            i += 1
        else:
            res.append(right[j])  
            j += 1
    for x in range(i, len(left)):
        res.append(left[x]) 
    for x in range(j, len(right)):
        res.append(right[x])
    return res 

if __name__ == "__main__":
    N = int(input())
    l = list(map(int, input().split(" ")))
    print(" ".join(map(str, mergesort(l, 0, len(l) - 1))))