Description: 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.
To Search:
File list (Check if you may need any files):
背包
....\Cpp1.cpp
....\Cpp1.dsp
....\Cpp1.dsw
....\Cpp1.ncb
....\Cpp1.opt
....\Cpp1.plg
....\Debug
....\.....\Cpp1.exe
....\.....\Cpp1.ilk
....\.....\Cpp1.obj
....\.....\Cpp1.pch
....\.....\Cpp1.pdb
....\.....\vc60.idb
....\.....\vc60.pdb
Download