Help me in solving MAGICJAR problem

help
,
1

My issue

I could’nt understand the pocess and logic exactly.

My code

for _ in range(int(input())):
    n=int(input())
    l=list(map(int,input().split()))
    print(max(l))

Problem Link: MAGICJAR Problem - CodeChef

2

There’s the approach:-
All the Junior Chefs are picking up jars simultaneously and none of the junior chefs are able to acquire enough jars to prepare their dish. Assuming every junior chef is accruing exactly “Required-1” Jars… so that all can fail to prepare their dish. And Session failed declared. After that only one additional jar is needed so that, first junior chef complete their dish and returns all the jars to the kitchen and other junior chef will pick that to prepare their dish.