0-N Knapsnack Problem

#1


I referred to the hint to this problem but the output is still coming 0.Please correct

#2

Hey @Yukta there were many small mistakes in your code

  1. size of arrays a, b would be greater than 1000
  2. while taking input of b use cin >> b[j] instead of b[value]
  3. in ans function dp size would be w+1
  4. you dont need to return anything when dp[i] != -1
  5. and your if condition is wrong the right if condition is if(a[j]<=i)dp[i]=max(dp[i],dp[i-a[j]] + b[j]);
    Here is link of the code after rectification https://ide.codingblocks.com/s/176942
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.