python数组大小用二叉树(小顶堆)排序

import heapq
a = [1,3,2,7,5,4,9,0]
b= []
for i in a:
    heapq.heappush(b,i)
c= []
for k in range(len(b)):
    c.append(heapq.heappop(b))
print(c)

result:[0, 1, 2, 3, 4, 5, 7, 9]