You could construct all subsets, check that the weight is less than the weight of the knapsack, and then choose the subset with the maximum value.

你可以构建所有子集，检查重量是否小于背包的重量，然后选择最大值的子集。