COVER THEM ALL PROBLEM 2 test case passed only

def sumPairs(arr, n):
Sum=0
i=n-1
while i>=0:
add = 0
j = 0
while j < i:
if arr[j][1] > arr[i][1]:
add += arr[j][1]
else:
add += arr[i][1]
j+=1
sub = 0
j = i+1
while j < n:
if arr[j][1] > arr[i][1]:
sub += arr[j][1]
else:
sub += arr[i][1]
j+=1
Sum += addarr[i][0] - subarr[i][0];
i-=1
return Sum;

t = int(input())
k = 0
while k < t:
n = int(input())
array = [i for i in map(int,input().split(’ ‘))]
weight = [i for i in map(int,input().split(’ '))]
arr = [i for i in zip(array,weight)]
arr = sorted(arr, key=lambda x: x[0])
Sum=sumPairs(arr, n)
print(Sum%(1000000007))
k+=1

Do add the question link. And instead of sharing your whole code ,share the link to your code.