Introduction - If you have any usage issues, please Google them yourself
Knapsack problem dynamic programming algorithm:// knapsack problem, the capacity of M, N type of cargo weight, respectively W1, W2... Wn, profits were P1, P2... Pn, maximum profit