/
knapsack.cpp
51 lines (49 loc) · 1.19 KB
/
knapsack.cpp
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
47
48
49
50
51
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <memory.h>
#include <set>
using namespace std;
int dp[2010][2010];
set<int> values;
vector<int> elements;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int T, n, k;
cin>>T;
while(T--){
values.clear();
elements.clear();
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
cin>>n>>k;
for(int i = 0; i < n; ++i){
int temp;
cin>>temp;
values.insert(temp);
}
for(int v: values){
elements.push_back(v);
}
int ans = 0;
for(int i = 0; i <= elements.size(); ++i){
for(int j = 0; j <= k; ++j){
dp[i + 1][j] |= dp[i][j];
if(i){
if(dp[i][j]){
if(j + elements[i - 1] <= k){
dp[i][j + elements[i - 1]] = 1;
}
}
}
if(dp[i][j]){
ans = max(ans, j);
}
}
}
cout<<ans<<endl;
}
return 0;
}