Question 5 Rocky Bhai Solution

def BinarySearch():
    left = 0
    right = 10**9+101
    res = 0
    while left <= right:
        Sum = [0] * m
        mid = (left+right) // 2
        for i in range (m):
            Sum[i] = max((mid - t[i])//p[i] + 1, 0)
        Sum.sort(reverse = True)
        x = sum(Sum[0:(n)])
        if x >= k:
            right = mid - 1
            res = mid
        else:
            left = mid + 1

    return res

a = int(input())
while a!= 0:
    a -= 1
    m,n,k = map(int, input().split())
    t = list(map(int, input().split()))
    p = list(map(int, input().split()))
    print(BinarySearch())
  # cook your dish here