HDOJ(HDU) 2083 简易版之最短距离(中位数)

import java.util.Arrays;
import java.util.Scanner;

public class Main{

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while(t-->0){
            int n =sc.nextInt();
            int a[] = new int[n];
            for(int i=0;i<n;i++){
                a[i]=sc.nextInt();
            }
            Arrays.sort(a);
            int num=0;
            for(int i=0;i<n;i++){
                num +=(int ) Math.abs(a[n/2]-a[i]);
            }
            System.out.println(num);
        }
    }
}