akshitagit / akshitagit/Python
Slightly modified Knapsack problem.
未关闭
algorithms
datastructures
DSA
good first issue
hacktoberfest
hacktoberfest2020
hactoberfest
- 主要语言
- Python
- 星标
- 124
- 派生
- 109
- PR 合并指标
- 30 天内没有已合并 PR
描述
You have to choose some of the N items. Your knapsack has a capacity of W which means that the sum of the weights of items taken must be at most W. Item i has a weight of Wi and a value of Vi. Find the maximum possible sum of the values of items that you can home.
The twist here being that the constraints for W is 1<=W<=1e9. 1<=Vi<=1e3.
Found this to be a very interesting variation of the popular knapsack problem and would love to contribute under hacktoberfest. Can this be assigned to me?
P.S : Code in Python.
贡献指南
评估
这个 Issue 还没有评估数据。