def heap_sort(source: List[int]) -> List[int]: heap = HeapMax() for i in source: heap.insert(HeapItem(i, None)) return [heap.get_item_max().priority for _ in range(heap.size())]