(1) Heap: in-place sorting using heap in O(n log n).

(2) Using heaps to improve merge k lists of size n each in O(n log k) time.

(3) How to find the kth smallest element using min-heaps in O(k log k) time.

One solution.

• On various priority queue functions: read.