Help me in solving AO17 problem

My issue

My code

# Update the code below to solve this def competition_result():
    # Read the number of test cases
T = int(input())

    # Process each test case
for i in range(T):
        # Read the number of races
    N = int(input())

        # Read the finish times of Alice and Bob
    alice_times = list(map(int, input().split()))
    bob_times = list(map(int, input().split()))

        # Find the minimum finish times for Alice and Bob
    alice_min_time = float('inf')
    bob_min_time = float('inf')

    for i in range(N):
        alice_min_time = min(alice_min_time, alice_times[i])
        bob_min_time = min(bob_min_time, bob_times[i])

        # Determine the winner
    if alice_min_time < bob_min_time:
    elif bob_min_time < alice_min_time:

# Call the competition_result function to solve the problem

Learning course: Solve Programming problems using Python
Problem Link: CodeChef: Practical coding for everyone

@fazal135 - you have understood the question incorrectly.

  1. Your code is checking for whoever had the lowest time - alice_min_time, bob_min_time. That is not what the problems needs you to solve
  2. The problem talks about the total race time excluding one race.

Try it again!