Submission #5035229

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>

using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define INF (1e9)

int N;

int main() {
    cin >> N;

    vi t(N);
    for (int i = 0; i < N; i++) {
        cin >> t[i];
    }

    sort(t.begin(), t.end(), greater<int>());
    int A = 0, B = 0;
    for (int i = 0; i < N; i++) {
        if (A <= B)
            A += t[i];
        else
            B += t[i];
    }

    cout << max(A, B) << endl;
    return 0;
}

Submission Info

Judge Result