Pagini recente » Cod sursa (job #168929) | Cod sursa (job #3247911) | Cod sursa (job #138012) | Cod sursa (job #2831513) | Cod sursa (job #3285973)
#include <bits/stdc++.h>
#define pii pair<int,int>
using namespace std;
ifstream f("ghiozdan.in");
ofstream g("ghiozdan.out");
int n,gmax,x,val[75200],bk[75200],ap[220];
vector <pii> v[75200];
int32_t main()
{
f>>n>>gmax;
for(int i=1; i<=n; i++)
f>>x, ap[x]++;
bk[0]=1;
for(int i=200; i>=1; i--)
{
for(int j=gmax-i; j>=0; j--)
{
if(bk[j])
for(int k=1; k<=ap[i] and j+i*k<=gmax; k++)
{
if(bk[j+i*(k-1)] and (bk[j]+k<=bk[j+i*k] or bk[j+i*k]==0))
bk[j+i*k]=bk[j]+k, v[j+i*k]=v[j], v[j+i*k].push_back({i,k});
}
}
}
int p=0;
for(int i=gmax; i>=1; i--)
if(bk[i])
{p=i, g<<i<<' '<<bk[i]-1<<'\n'; break;}
for(auto it:v[p])
for(int i=1; i<=it.second; i++)
g<<it.first<<'\n';
return 0;
}