Pagini recente » Cod sursa (job #2784614) | Cod sursa (job #2910969) | Cod sursa (job #1749329) | Cod sursa (job #3156585) | Cod sursa (job #2124196)
#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;
/*
void afisare()
{
for (int i = 0; i <= G; i++)
printf("(%d, %d) ", dp[i].nr, dp[i].prev);
printf("\n");
}*/
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])
{
for (int j = G; j >= i; j--)
{
if (dp[j].nr == oo)
{
int k = 1;
while (dp[j - k * i].nr == oo && k <= fr[i])
{
k++;
if (k * i > j)
break;
}
if (k * i <= j && k <= fr[i])
{
int ng = j - k * i;
dp[j].nr = dp[ng].nr + k;
dp[j].prev = 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);
}