Find the minimum sum of squared Euclidean distance between two arrays

Question

Here\'s the question : given two sorted sequences in increasing order, X and Y.
Y is of size k and X is of size m. Now, we would like to take a subset of X of size k,