### 問題：
怎樣從一個集合中獲得最大或者最小的 N 個元素列表
### 解決方案：
heapq 模塊有兩個函數：nlargest() 和 nsmallest() 可以完美解決這個問題
```python
import heapq
nums = [1, 8, 32, 4, -1, 4, 89, 34, 5, 77, 5, 53476, 898, 243, 689, 60]
print(heapq.nlargest(3, nums)) # [53476, 898, 689] 取最大的三個值
print(heapq.nsmallest(3, nums)) # [-1, 1, 4] 取最小的三個值
portfolio = [
{'name': 'IBM', 'shares': 100, 'price': 91.1},
{'name': 'AAPL', 'shares': 50, 'price': 543.22},
{'name': 'FB', 'shares': 200, 'price': 21.09},
{'name': 'HPQ', 'shares': 35, 'price': 31.75},
{'name': 'YHOO', 'shares': 45, 'price': 16.35},
{'name': 'ACME', 'shares': 75, 'price': 115.65}
]
cheap = heapq.nsmallest(3, portfolio, key=lambda s: s['price'])
expensive = heapq.nlargest(3, portfolio, key=lambda s: s['price'])
print(cheap)
print(expensive)
```
原文來自；
> https://python3-cookbook.readthedocs.io/zh_CN/latest/c01/p04_find_largest_or_smallest_n_items.html
