heapsort.py

#!/usr/bin/python3
# file: heapsort.py

from queue import PriorityQueue

q = PriorityQueue()
A = list(map(int, input().split()))
for a in A:
    q.put(a)
A = []
while not q.empty():
    A.append(q.get())
print(" ".join(map(str, A)))