for i←1 to n do:
for c←1 to C do:
if w[i]≤j :
dp[i][j]=max(dp[i-1][j],dp[i-1][j-wi]+vi)
end
else:
dp[i][j]=dp[i-1][j]
end
end
end
return dp[n][C]
08-01
1135
01-03
for i←1 to n do:
for c←1 to C do:
if w[i]≤j :
dp[i][j]=max(dp[i-1][j],dp[i-1][j-wi]+vi)
end
else:
dp[i][j]=dp[i-1][j]
end
end
end
return dp[n][C]