Submission #3415879

---

Source Code Expand

#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>

#include <numeric>
#include <memory>

#include <map>
#include <vector>
#include <queue>


using namespace std;

typedef long long LL;
#define REP(i, N) for (int i = 0; i < N; ++i)

vector <int> v;

int main() {
    int n; cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        int x; cin >> x; v.push_back(x);
    }
    sort(v.begin(), v.end());
    
    int cnt = 0, a = 0, b = 0;
    for (auto it = v.begin(); it != v.end(); ++it) {
        if ((++cnt) & 1)
            a += *it;
        else b += *it;
    }
    cout << abs(a - b) << endl;
    
}

Submission Info

Judge Result