Smallest Range Covering Elements from K Lists

Question Explain

You have $k$ lists of sorted integers. Find the smallest range that includes at least one number from each of the $k$ lists. Use a Min-Heap.