Apple Division

def solve(index, apples, sum1, sum2, number_of_apple):

    if index == number_of_apple:
        return abs(sum1 - sum2)

    choose = solve(index + 1, apples, sum1 + apples[index], sum2, number_of_apple)

    not_choose = solve(index + 1, apples, sum1, sum2 + apples[index], number_of_apple)

    return min(choose, not_choose)

def main():
    number_of_apple = int(input())
    apples = [int(apple) for apple in input().split(" ")]
    apples.sort()

    ans = solve(0, apples, 0, 0, number_of_apple)
    print(ans)



if __name__ == "__main__":
    main()

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