Problem 23 · Hard
Use a min-heap over current list heads to repeatedly pick the global minimum in O(N log k).
Open the interactive visualisation