Submission #5023377

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> P;
bool bitcheck(int bit, int position)
{
    if ((bit >> position) & 1)
        return true;
    else
        return false;
}
int main()
{
    int n;
    cin >> n;
    int t[4];
    rep(i, n)
    {
        cin >> t[i];
    }
    lint ans = INT_FAST16_MAX;
    rep(i, 1 << n)
    {
        int a = 0;
        int b = 0;
        rep(j, n)
        {
            if (bitcheck(i, j))
            {
                a += t[j];
            }else
            {
                b+= t[j];
            }
        }
        int cc = max(a, b);
        if(cc<ans)
            ans = cc;
    }
    cout<<ans<<endl;

    return 0;
}

Submission Info

Judge Result