Find k combinations in vector whose sums are closest to each other

Question

Let\'s say we have a vector of integers of length n. We also have a number k (n>k>1), which represents the n