LintCode - Backpack II

class Solution {
public:
/**
* @param m: An integer m denotes the size of a backpack
* @param A & V: Given n items with size A[i] and value V[i]
* @return: The maximum value
*/
int backPackII(int m, vector<int> A, vector<int> V) {
// write your code here
vector<int> result(m+1, 0);
for (int i = 0; i < A.size(); i++) {
for (int j = m; j >= A[i]; j--) {
result[j] = max(result[j], result[j-A[i]] + V[i]);
}
}
return result[m];
}
};