23. Merge k Sorted Lists

Merging the k lists one after another costs O(kN) worst case — each pass re-walks a growing result. What you actually need is a cheap way to pull the global minimum of the current k heads, over and…