Apple Division

def find_min_rec(list_of_apples, i, sum_stack, sum_total):
    if i == 0:
        return abs((sum_total - sum_stack) - sum_stack)

    return min(
        find_min_rec(
            list_of_apples, i - 1, sum_stack + list_of_apples[i - 1], sum_total
        ),
        find_min_rec(list_of_apples, i - 1, sum_stack, sum_total),
    )


n = int(input())
apples = [int(p) for p in input().split()]

result = find_min_rec(apples, n, 0, sum(apples))

print(result)

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