Apple Division

def sort_apples(apples_count, apples_weights):
    apples_weights.sort(reverse=True)
    sum_weights = sum(apples_weights)
    half = sum_weights / 2
    pile1 = []
    pile1_weight = 0
    pile2 = []
    pile2_weight = 0
    for apple_number, apple_weight in zip(range(1, apples_count + 1), apples_weights):
        if pile2_weight + apple_weight < half:
            pile2.append(apple_number)
            pile2_weight += apple_weight
        else:
            pile1.append(apple_number)
            pile1_weight += apple_weight

    difference = abs(pile1_weight - pile2_weight)
    print(difference)

n = int(input())
weights = list(map(int, input().split()))

sort_apples(n, weights)

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED