Apple Division

#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>
/*
sort(apples)
weightA=0
weightB=0
for (apples from last to first)
if (weightB=>weightA) {

    weightA+=appleweight
} else weightB+=appleweight;

return abs(weightA-weightB)
*/

/*Total weight of apples do not fit in 32bit integers in tests I failed
 * during the competition.
 */

int main() {
    using std::cin;
    using std::vector;
    int n;
    cin>>n;
    vector<int64_t> apples;
    for (int i=0;i<n;i++) {
        int j;
        cin>>j;
        apples.emplace_back(j);
    }
    int64_t minimum=2147483647;
    int count=0;
    //std::sort(apples.begin(),apples.end());
    for (int i=0;i<=(1<<n)+1;i++) {
       int64_t  weightA=0,weightB=0;
        count++;
        for (int j=0;j<n;j++) {
            if (i&(1<<j)) {
                weightA+=apples[j];
            } else {
                weightB+=apples[j];
            }
        }
        if (weightA>=weightB) {
            minimum=std::min(minimum,weightA-weightB);
        } else {
            minimum=std::min(minimum,weightB-weightA);
        }

    }
   
    std::cout<<minimum<<std::endl;
}

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