From wiki:
Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible
Given that all items costs are 1$ for 1Kg, aka weights are equal to values. Will this problem will also be NP-hard like knapSack 0-1?