-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCD.cpp
90 lines (82 loc) · 2.31 KB
/
CD.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
ifstream fin("CD.in");
ofstream fout("CD.out");
int main()
{
while (true)
{
int total = - 1, size0;
fin >> total >> size0;
if (total == -1)
{
break;
}
vector<int> a(size0);
for (int i = 0; i <= size0 - 1; ++i)
{
fin >> a[i];
}
vector<vector<int>> dp(size0, vector<int>(total + 1, 0));
vector<vector<vector<int>>> s(size0, vector<vector<int>>(total + 1));
for (int i = 0; i <= size0 - 1; ++i)
{
if (i == 0)
{
for (int j = 0; j <= total; ++j)
{
if (j < a[0])
{
dp[i][j] = 0;
}
else
{
dp[i][j] = a[0];
s[i][j].push_back(a[0]);
}
}
}
else
{
for (int j = 0; j <= total; ++j)
{
if (j < a[i])
{
dp[i][j] = dp[i - 1][j];
s[i][j] = s[i - 1][j];
}
else
{
if (dp[i - 1][j] > dp[i - 1][j - a[i]] + a[i])
{
dp[i][j] = dp[i - 1][j];
s[i][j] = s[i - 1][j];
}
else
{
dp[i][j] = dp[i - 1][j - a[i]] + a[i];
s[i][j] = s[i - 1][j - a[i]];
s[i][j].push_back(a[i]);
}
}
}
}
}
int size1 = s[size0 - 1][total].size();
for (int i = 0; i <= size1 - 1; ++i)
{
fout << s[size0 - 1][total][i] << " ";
}
fout << "sum:" << dp[size0 - 1][total] << '\n';
}
return 0;
}