Cod sursa(job #2124308)

Utilizator RazorBestPricop Razvan Marius RazorBest Data 7 februarie 2018 08:47:52
Problema Ghiozdan Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.6 kb
#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 - i; j >= 0; j--)
            {
                if (dp[j].nr != oo)
                {
                    int k = 1;

                    while (dp[j + k * i].nr == oo && k <= fr[i])
                    {
                        dp[j + k * i].nr = dp[j].nr + k;
                        dp[j + k * i].prev = i;
                        k++;
                        if (j + k * i > G)
                            break;
                    }
                }
            }
        }
    }
}

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);
}