Transform the model into a classic unbounded knapsack problem and present a dynamic programming algorithm to solve it.

• 对此模型用动态规划的方法进行求解,得到了测试用例的最优分配方案;