Introduction - If you have any usage issues, please Google them yourself
Knapsack problem: has different values, different weights of objects n pieces, find some items selected n items in the program, bringing the total weight of the selected items does not exceed the specified weight limit, but the maximum total value of selected items.