Heap usage

Top-k, k-way merge, dual heap median.

Try this in Python

import heapq

nums = [3, 1, 4, 1, 5, 9]
print(heapq.nlargest(3, nums))

Key takeaways

• Streaming size-k heap.
• Tuple keys.
• Lazy delete.