search

akshitagit / Python

Repository for Python codes and algos. Star the repo too.
https://github.com/akshitagupta15june
MIT License
121 stars 110 forks source link

Slightly modified Knapsack problem. #109

Open bdyutish opened 3 years ago

bdyutish commented 3 years ago

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.

Tejoooo commented 11 months ago

@bdyutish can u assign me this issue i am interested to solve this