[LeetCode] 632. Smallest Range Covering Elements from K Lists 覆盖K个列表元素的最小区间

You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists. We define