#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 1e5+10;
int n, w[N];
int main()
{
cin >> n;
for (int i = 0; i < n; i++) cin >> w[i];
sort(w, w+n);
int mid = (n-1) / 2; //中位数的下标
int sum = 0;
for (int i = 0; i < n; i++)
sum += abs(w[i] - w[mid]);
cout << sum;
return 0;
}
推荐题解