题解：货仓选址（3月21日）

#include <bits/stdc++.h>
using namespace std;
int a[100005];
int n;
int k, m, ans;

int main() {
    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> a[i];

    sort(a, a + n + 1);


    if (n % 2 == 0)
        k = a[n / 2], m = n / 2;
    else
        k = a[n / 2 + 1], m = n / 2 + 1;

    for (int i = 1; i <= m; i++)
        ans += k - a[i];

    for (int i = n; i > m; i--)
        ans += a[i] - k;

    cout << ans;

    return 0;
}