设X[0:n-1]和Y[0:n-1]为2 个数组,每个数组中含有n 个已排好序的数。试设计一个 O(log n)时间的算法,找出X 和Y 的2n 个数的中位数。-Let X [0: n-1] and Y [0: n-1] for the two arrays, each array containing the n number has been sorted. Try to design an O (log n) time algorithm to find the X and Y 2n