പങ്കാളിത്ത ഓഡിയോ

for (int i = 1; i <= n; i++) { for (int w = 1; w <= W; w++) { if (wt[i - 1] <= w) { dp[i][w] = max( dp[i - 1][w], val[i - 1] + dp[i - 1][w - wt[i - 1]] ); } else { dp[i][w] = dp[i - 1][w]; } } } return dp[n][W]; }