按照坐标大小排序。
1. k到(x1, x2)两点的最小距离之和,一定是: 当 x1<=k<=x2时,距离为 x2 - x1
2. k属于(a[1], a[n])时,到a1和an的最小距离和为a[n]-a[1]
3. k属于(a[2], a[n-1])时,到a1,和an的最小距离和为a[n-1]-a[2]
4. ....
故k取中位数即可
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n ; i++) {
int x = scanner.nextInt();
arr[i] = x;
}
Arrays.sort(arr);
int sum = 0;
for (int i = 0; i < n/2; i++) {
sum += arr[n-1 - i] - arr[i];
}
System.out.println(sum);
}
}