有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。-With N items and a capacity of V backpack. S i is the cost of items c [i], value w [i]. Solving the items into the bag which allows the cost of these items does not exceed the sum of the capacity backpack, and the value of the sum of the maximum.