Pagini recente » Cod sursa (job #2363178) | Cod sursa (job #982729) | Cod sursa (job #177479) | Cod sursa (job #414958) | Cod sursa (job #2632663)
#include <bits/stdc++.h>
using namespace std;
ifstream in("ghiozdan.in");
ofstream out("ghiozdan.out");
int n, wmax, weight, fr[205], fweight, dp[75005], ans[75005];
int main()
{
in >> n >> wmax;
for(int i = 1; i <= n; i++) {
in >> weight;
fr[weight] += 1;
}
dp[0] = 1;
for(int i = 200; i >= 1; i--) {
for(int j = wmax; j >= 0; j--) {
if(dp[j]) {
for(int k = 1; k * i + j <= wmax && k <= fr[i]; k++) {
if(dp[j + k * i]) {
break;
}
dp[i * k + j] = dp[j] + k;
ans[i * k + j] = i;
}
}
}
}
while(!dp[wmax]) {
wmax -= 1;
}
out << wmax << ' ' << dp[wmax] - 1 << '\n';
while(wmax) {
out << ans[wmax] << '\n';
wmax -= ans[wmax];
}
return 0;
}