Basic heap usage, the Top-K pattern, two-heap median tracking, and k-way merge / scheduling problems that need a priority queue.