【題解】TIOJ 1732 . 買當勞

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n, a, mid, ans;
vector <int> v;

int main() {
    while (cin >> n){
        v.clear();
        for (int i = 0; i < n; i++){
            cin >> a;
            v.push_back(a);
        }
        sort(v.begin(), v.end());
        ans = 0;
        mid = v[n/2];
        for (int i = 0; i < n; i++){
            ans += abs(v[i]-mid);
        }
        cout << ans << "\n";
    }
}