Envío 1546

Código

import heapq

def mergesort(arr, num_elements):
  if num_elements > 1:
    pivot = num_elements // 2
    left = mergesort(arr[:pivot], pivot)
    right = mergesort(arr[pivot:], num_elements - pivot)
    merged = []
    while left and right:
      lowest = left.pop(0) if left[0] < right[0] else right.pop(0)
      merged.append(lowest)
    merged.extend(left)
    merged.extend(right)
    return merged
  else:
    return arr

def heapsort(arr, num_elements):
  _ = heapq.heapify(arr)
  return [heapq.heappop(arr) for _ in range(num_elements)]

if __name__ == "__main__":
  num_elements = int(input())
  arr = list(map(int, input().split(' ')))
  
  # Use a different sort every minute
  sorts = [mergesort, heapsort]
  sort_idx = -1
  sorted_arr = sorts[sort_idx](arr, num_elements)
  print(' '.join(map(str, sorted_arr)))