fork download
  1. def fn(arr, k):
  2. n=len(arr)
  3. dp=[[0]*(k+1) for _ in range(n+1)]
  4.  
  5. for i in range(1, n + 1):
  6. for j in range(1, k + 1):
  7. dp[i][j]=dp[i-1][j]
  8. items = 1
  9. while items <=j:
  10. dp[i][j]=max(dp[i][j],arr[i-1][items-1]+dp[i-1][j-items])
  11. items+=1
  12.  
  13. return dp[n][k]
Success #stdin #stdout 0.02s 9304KB
stdin
Standard input is empty
stdout
Standard output is empty