Help me in solving AIRM problem

My issue

My code

# cook your dish here
        

t = int(input().strip())
output= []
for _ in range(t):
    n = int(input().strip())
    arrival= list(map(int, input().strip().split()))
    departure= list(map(int, input().strip().split()))
    res = solve(n, arrival, departure)
    output.append(res)
print(output)

def solve(n, arrival, departure):
    tmp_airports = n
    timings = list(zip(arrival, departure))
    runway  = 0
    for i in range(n-1):
        if timings[i][1] >= timings[i+1][0]:
            runway += 1
    return runway
     



Problem Link: AIRM Problem - CodeChef