Slightly modified Knapsack problem
未關閉
algorithms
C
CPP
good first issue
hacktoberfest
Hacktoberfest2020
up for grabs
- 主要語言
- C++
- 星號
- 504
- 分支
- 436
- 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 C++
貢獻指南
這個儲存庫沒有索引到貢獻指南
評估
這個 Issue 還沒有評估資料。