Pagini recente » Cod sursa (job #1399862) | Cod sursa (job #1773523) | Cod sursa (job #1900150) | Cod sursa (job #1127441) | Cod sursa (job #2124310)
#include <cstdio>
#define oo 0x7fffffff - 2
using namespace std;
FILE *fin = freopen("ghiozdan.in", "r", stdin), *fout = freopen("ghiozdan.out", "w", stdout);
struct din
{
int nr, prev;
} dp[75001];
int fr[201], n, G, x;
int min(int a, int b)
{
return a < b ? a : b;
}
void back(int i)
{
while (i != 0)
{
printf("%d\n", dp[i].prev);
i -= dp[i].prev;
}
}
void dinamica()
{
for (int i = 0; i <= G; i++)
dp[i].nr = oo;
dp[0].nr = 0;
for (int i = 200; i >= 1; i--)
{
if (!fr[i])
continue;
for (int j = G - i; j >= 0; j--)
{
if (dp[j].nr == oo)
continue;
int k = 1, lim = min(fr[i], (G - j) / i), l = j + i;
while (dp[l].nr == oo && k <= lim)
{
dp[l].nr = dp[j].nr + k;
dp[l].prev = i;
k++;
l += i;
}
}
}
}
bool cmp(int a, int b)
{
return a > b;
}
int main()
{
scanf("%d %d", &n, &G);
for (int i = 1; i <= n; i++)
{
scanf("%d", &x);
fr[x]++;
}
dinamica();
int poz;
for (int i = G; i >= 0; i--)
{
if (dp[i].nr != oo)
{
poz = i;
break;
}
}
printf("%d %d\n", poz, dp[poz].nr);
back(poz);
}