Minimum Cost Pairs

Given an array of n integers, consider pairings of k pairs. Each number can appear in at most one pair, and the cost of a pair (a,b) is |a-b|. The cost of a pairing is the sum of all costs of the pairs. Calculate the minimum costs of pairings for k=1,2,\dots,\lfloor n/2 \rfloor. Input The first line has an integer: the array size. The next line has n integers x_1,x_2,\dots,x_n: the array conte