Submission #3236171

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include "bits/stdc++.h"
using namespace std;
typedef long long unsigned int ll;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()



int main() {
    int N,cntA=0,cntB=0;
    cin>>N;
    vector<int> a(N);
    for(int i=0;i<N;i++)
        cin>>a.at(i);
    sort(a.begin(),a.end());
    reverse(a.begin(),a.end());
    for(int j=0;j<N;j++){
        if(j%2==0)
            cntA+=a.at(j);
        else cntB+=a.at(j);
    }
    cout<<cntA-cntB<<endl;

}

Submission Info

Judge Result