Envío 1564

Código

def shift_right(arr, low, high):
    root = low
    while root * 2 + 1 <= high:
        left = root * 2 + 1
        right = left + 1
        swap = root
        if arr[swap] < arr[left]:
            swap = left
        if right <= high and arr[swap] < arr[right]:
            swap = right
        if swap != root:
            arr[root], arr[swap], root = arr[swap], arr[root], swap
        else:
            break

def heapify(arr, low, high):
    mid = (high - low - 1) // 2
    while mid >= 0:
        shift_right(arr, mid, high)
        mid -= 1

def heapsort(arr):
    if arr:
        length = len(arr)
        high = length - 1
        heapify(arr, 0, high)
        while high > 0:
            arr[high], arr[0] = arr[0], arr[high]
            high -= 1
            shift_right(arr, 0, high)


if __name__ == "__main__":
    n = input()
    arr = list(map(int, input().split(" ")))
    heapsort(arr)
    print(" ".join(map(str, arr)))