Backpack II
Question
- lintcode: (125) Backpack II
Problem Statement
Given n items with size \[Ai\] and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack?
Given n items with size \[Ai\] and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack?
Given n items with size \(A_i\), an integer m denotes the size of a backpack. How full you can fill this backpack?