从n个排序数组中找到第k个最小的数

So, you have n sorted arrays (not necessarily of equal length), and you are to return the kth smallest element in the combined array (i.e the combined array formed by merging all the n sorted arrays)So, you have n sorted arrays (not necessarily o