The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the count of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.




File list:
knapstack
........\Debug
........\.....\BuildLog.htm
........\.....\knapstack.exe
........\.....\knapstack.exe.intermediate.manifest
........\.....\knapstack.ilk
........\.....\knapstack.pdb
........\.....\ks.obj
........\.....\mt.dep
........\.....\vc90.idb
........\.....\vc90.pdb
........\knapstack.ncb
........\knapstack.sln
........\knapstack.suo
........\knapstack.vcproj
........\knapstack.vcproj.Marina-ПК.Marina.user
........\ks.cpp