For this Question: Sara's team participated in an eating competition at FoodFest in which they are asked to eat at least P dishes.
Sara's team consists of N members where a member <b>i</b> (1 <= i <= N ) takes <b>Arr[i]</b> minutes to finish a single dish. Your task is to find the minimum time to finish at least P dishes.

Note: A member can eat a dish any number of times.First line of input contains two integers N and P. The next line of input contains N space separated integers depicting the values of Array.

Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 10
1 <= P <= 1000000000000Print the minimum time taken to eat at least P dishes.Sample Input:-
4 10
1 2 3 4

Sample Output:-
6

Explanation:-
1st member will eat 6 dishes
2nd member will eat 3 dishes
3rd member will eat 2 dishes
4th member will eat 1 dishes
total = 12

Sample Input:-
8 8 
1 1 1 1 1 1 1 1

Sample Output:-
1, I have written this Solution Code: def noofdish(B,t):
    a=0
    for x in B:
        a += t//x
    return a
def findans(A,l,r,ans,p):
    if(l>r):
        print(ans)
    else:
        m=(l+r)//2
        tdish=noofdish(A,m)
        if tdish >=p:
            findans(A,l,m-1,m,p)
        else:
            findans(A,m+1,r,ans,p)
n,p=[int(x) for x in input().split()]
A=[int(x) for x in input().split()]
findans(A,1,(p//n +1)*10,(p//n +1)*10,p), In this Programming Language: Python, Now tell me if this Code is compilable or not?