heapq是一种有序的数据结构，可以用来实现排序和寻找最值。

编程示例如下：

import heapq
import random

numbers=[]
for i in range(10):
    rand=random.randint(0,100)
    numbers.append(rand)
print(numbers)

print(heapq.nlargest(3,numbers))
print(heapq.nsmallest(3, numbers))

heap=list(numbers)
heapq.heapify(heap)
print(heap)

参考资料：

http://docs.python.org/3/library/heapq.html