// 2083 - 简易版之最短距离 int main() { const int maxn = 505; int M, N, sum, x, num[maxn]; cin >> M; while (M--) { cin >> N; memset(num, 0, sizeof(num)); sum = 0; for (int i = 0; i < N; i++) { cin >> num[i]; } // 排序 + 寻找中位数 sort(num, num + N); x = num[N / 2]; for (int i = 0; i < N; i++) { sum += abs(num[i] - x); } cout << sum << endl; } return 0;}
