Apple Division

#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define fill(arr,val) memset(arr,val,sizeof(arr))
#define FOR(i, a, b) for(__typeof(b) i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for(__typeof(a) i = a, _b = b; i >= _b; --i)
#define ALL(a) (a).begin(), (a).end()
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ii pair<int,int>
#define iii pair<int,pair<int,int>>
#define dq deque<int>
#define nend '\n'
using namespace std;

const ll hashi=2e9+11;
ll add(ll a, ll b) {
    return (a+b)%hashi;
}
ll sub(ll a, ll b) {
    return ((a-b)%hashi+hashi)%hashi;
}
ll mul(ll a, ll b) {
    return (a*b)%hashi;
}

const ll inf=1e18;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
const int N=50;
int a[N];
int main() {
    fast;

    int n;
    cin >> n;

    ll total = 0;

    FOR(i,0,n-1) {
        cin >> a[i];
        total += a[i];
    }

    ll ans = inf;

    FOR(mask,0,(1<<n)-1) {
        ll sum = 0;

        FOR(i,0,n-1) {
            if(mask & (1<<i))
                sum += a[i];
        }

        ans = min(ans, abs(total-2*sum));
    }

    cout << ans;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED