简单的背包问题：

有N件物品和一个容量为V的背包。第i件物品的重量是w[i]。在给定的背包容量的前提下，将哪些物品装入背包可使这些物品的重量总和不超过背包容量，且装进去的物品数量最多。-Simple knapsack problem: there are N items and a capacity of V backpack. By weight of the i-th items that w [i]. Under the premise of a given backpack capacity, which will make the sum of the items into the backpack weight of these items does not exceed the capacity of the backpack, and loaded into the maximum number of items.