#614324 (C++17) No.1374 Absolute Game

• 問題: No.1374 Absolute Game
• ユーザー: theory_and_me
• 提出日時: 2021-02-06 15:34:03
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 22 ms / 2,000 ms
• コード長: 2,445 bytes
• コンパイル時間: 2,294 ms
• コンパイル使用メモリ: 210,056 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-03 00:45:54
• 合計ジャッジ時間: 3,750 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	7 ms; 5,376 KB
testcase_09	AC	17 ms; 5,376 KB
testcase_10	AC	19 ms; 5,376 KB
testcase_11	AC	12 ms; 5,376 KB
testcase_12	AC	8 ms; 5,376 KB
testcase_13	AC	15 ms; 5,376 KB
testcase_14	AC	21 ms; 5,376 KB
testcase_15	AC	21 ms; 5,376 KB
testcase_16	AC	22 ms; 5,376 KB
testcase_17	AC	21 ms; 5,376 KB
testcase_18	AC	22 ms; 5,376 KB
testcase_19	AC	22 ms; 5,376 KB
testcase_20	AC	8 ms; 5,376 KB
testcase_21	AC	11 ms; 5,376 KB
testcase_22	AC	20 ms; 5,376 KB
testcase_23	AC	4 ms; 5,376 KB
testcase_24	AC	4 ms; 5,376 KB
testcase_25	AC	5 ms; 5,376 KB
testcase_26	AC	8 ms; 5,376 KB
testcase_27	AC	10 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

int main(){

    ll N;
    cin >> N;
    V<ll> c(N);
    REP(i, N) cin >> c[i];

    ll S = 0;
    REP(i, N) S += c[i];
    if(S>=0) sort(ALLR(c));
    else sort(ALL(c));

    ll x = 0, y = 0;
    REP(i, N) if(i&1) y += c[i]; else x += c[i];  

    cout << abs(x) - abs(y) << endl;

    return 0;
}