Description: Are known to have n kinds of goods and a weight capacity of M, backpacks, each item has its own weight and efficiency values, assume that n kinds of goods may be greater than the weight and M, such a situation, what kind of loaded goods into the backpack to get the most value?
To Search:
- [Calendar] - A simple calendar code
- [Python] - It shows the basic knowledge of Python i
File list (Check if you may need any files):
背包\Cpp2.exe
....\greedyknapsack.cpp
背包
Download