Help me in solving AO11 problem

help
,
1

My issue

I didn’t understand the question and when i’m saw the solution totally confused

My code

# Update the code below to solve the problem

t = int(input())
for i in range(t):
    N = int(input())
    A = list(map(int,input().split()))
    
    total_prize=sum(A)
    
    max_prize= total_prize-min(A)
    
    print(max_prize)

Learning course: Beginner DSA in Python
Problem Link: CodeChef: Practical coding for everyone