AcWing 104. 货仓选址

#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010;
int n;
int main(){
    int a[N];
    cin >> n;
    for(int i = 0; i < n; i++) cin >> a[i];
    sort(a,a + n);
    int res = 0;
    for(int i = 0 ; i < n; i++) res += abs(a[i] - a[n/2]);
    cout << res << endl;
    return 0;
}