Given k sorted arrays, select one element from each array such that the difference of maximum and minimum element of the selected elements is minimum

Question

Given k sorted arrays, select one element from each array such that the difference of maximum element and minimum element of the selected elements is minimum. Example for k

Answer 1

Shortest range in k sorted arrays/lists is the standard problem you are looking for, here is it's solution.