"Algorithm" full backpack

There are n items and a backpack with a capacity of M, with unlimited pieces available for each item. The volume of the article I is weight, and the value is values. The solution of which items are loaded into the backpack allows the volume of these items to be no more than the backpack capacity, and the value of the largest sum.

1 //"n" is the number of kinds.2 //"M" is the capacity of the bag.3 //w[]:weight, V[]:value.4 5  for(intI=1; I <= N; i++) {6      for(intVal=0; Val<=m; val++) {7         if(Val >= w[i]) dp[val] = max (Dp[val], dp[Val-w[i]]+v[i]);8     } 9}

"Algorithm" full backpack