The NP-Completeness of them is proven by reduction from the well known KNAPSACK problem.

• 用整数背包问题具体证明了这两个问题的NP-完备性。