Smallest Range Covering Elements from K Lists

Sliding window on k sorted lists via min-heap: we always have one representative from each list. The range is bounded by the heap minimum and the global maximum. To shrink the range, advance the minimum (it's the bottleneck). When a list is exhausted, no improvement is possible — stop. O(n log k) where n = total elements.