CalcMin code

 def calcmin(K,N,Q,S,P):

 sum=0

 if len(Q)==1:

  for i in P:

   if sum<Q[0]:

    sum=sum+P[i]

  return i+1

 elif len(Q)>1:

  i=0

  arr=[]

  while i<len(Q)-1:

   x=Q[i]

   for j in S,P:

    if S[j]==Q.index(x) and P[j]<x:

     if sum<x:

      sum=sum+P[j]

   i+=1

   arr.append(i)

 return max(arr)

Python