blob: 50297b224febf8afc8c00b348f880a640715ddb7 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
#include <iostream>
#include <vector>
//#include <gtest/gtest.h>
using std::vector;
int optimalWeight(int W, vector<int> &w2) {
int j = w2.size();
// int value[W + 1][j + 1];
vector< vector<int> > value(W + 1, vector<int>(j + 1));
for (int i = 0; i < j + 1; i++) {
for (int w = 0; w < W + 1; w++) {
if (i == 0 || w == 0) {
value[w][i] = 0;
continue;
}
value[w][i] = value[w][i - 1];
if (w2[i - 1] <= w) {
int val = value[w - w2[i - 1]][i - 1] + w2[i - 1];
if (value[w][i] < val) {
value[w][i] = val;
}
}
}
}
return value[W][j];
}
//TEST(Knapsack, t1) {
// vector<int> w = { 1, 4, 8 };
// int W = 10;
// ASSERT_EQ(9, optimalWeight(W, w));
//}
int main() {
int n, W;
std::cin >> W >> n;
vector<int> w(n);
for (int i = 0; i < n; i++) {
std::cin >> w[i];
}
std::cout << optimalWeight(W, w) << '\n';
}
|