Apple Division

# inputs
# for number of apples
appleNum = int(input())

appleWeights = input()
appleWeightsParts = appleWeights.split()
appleWeightsList = [int(w) for w in appleWeightsParts]
appleWeightsList.sort()

# print(appleWeightsList)

# if 1 apple
if appleNum == 1:
  print(0)
# if 2 apples
elif appleNum == 2:
  diff = appleWeightsList[1] - appleWeightsList[0]
  print(diff)
# if > 2 apples
else:
  # get mid point
  midPoint = appleNum // 2

  minApples = float('inf')
  currAppleWeightsList = appleWeightsList

  for i in range(appleNum):
    leftGroup = sum(currAppleWeightsList[:midPoint + 1])
    rightGroup = sum(currAppleWeightsList[midPoint + 1:])

    diff = abs(rightGroup - leftGroup)
    minApples = min(diff, minApples)

    # del first int and add to the back
    currAppleWeightsList = currAppleWeightsList[1:] + [currAppleWeightsList[0]]

  print(minApples)

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: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED