#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int a[400001];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++ i)
cin >> a[i];
sort(a, a + n);
int mid = a[( n ) / 2];
long long w = 0;
for (int i = 0; i < n; ++ i)
w += abs(a[i] - mid);
cout << w;
return 0;
}
尽可能为两货舱之间选址。