Pagini recente » Cod sursa (job #1747472) | Cod sursa (job #1156818) | Cod sursa (job #2180817) | Cod sursa (job #3175430) | Cod sursa (job #2152983)
#include <fstream>
using namespace std;
ifstream in("ghiozdan.in");
ofstream out("ghiozdan.out");
const int NMAX = 75000;
const int VMAX = 200;
int n, g, res;
int ap[1 + VMAX];
int dp[1 + NMAX];
int sol[1 + NMAX];
int main()
{
in >> n >> g;
for(int i = 1; i <= n; i++) {
int x;
in >> x;
ap[x]++;
}
dp[0] = 1;
for(int i = VMAX; i >= 1; i--) {
if(0 < ap[i]) {
for(int k = g - i; k >= 0; k--) {
if(dp[k] == 0)
continue;
for(int j = 1; j <= ap[i]; j++) {
int p = i * j + k;
if(p <= g && dp[p] == 0) {
dp[p] = dp[k] + j;
sol[p] = i;
res = max(res, p);
} else {
break;
}
}
}
}
}
out << res << ' ' << dp[res] - 1 << '\n';
while(res != 0) {
out << sol[res] << '\n';
res -= sol[res];
}
in.close();
out.close();
return 0;
}