Submission #5033753

---

Source Code Expand

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

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, t[N], ans = 999999, niku0, niku1;
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> t[i];
    }

    for (int bit = 0; bit < (1 << N); bit++) {
        niku0 = 0, niku1 = 0;
        for (int i = 0; i < N; i++) {
            if (bit & (1 << i)) {
                niku0 += t[i];
            } else {
                niku1 += t[i];
            }
        }
        ans = min(max(niku0, niku1), ans);
    }
    cout << ans << endl;
}

Submission Info

Judge Result