Cod sursa(job #774452)
#include <fstream>
using namespace std;
ifstream f("ghiozdan.in");
ofstream g("ghiozdan.out");
short a[20001][75001];
int main()
{
int n,G;
f>>n>>G;
int i,j,v[n+1],smax=0,nmin=21000;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=G;j++)
{
a[i][j]=a[i-1][j];
if(v[i]==j)
a[i][j]=1;
else if(j>v[i])
if(a[i-1][j-v[i]] && (a[i-1][j-v[i]]+1<a[i][j] || a[i][j]==0))
a[i][j]=a[i-1][j-v[i]]+1;
if(a[i][j] && smax<j)
{ smax=j; nmin=a[i][j];}
if(a[i][j] && smax==j && a[i][j]<nmin)
nmin=a[i][j];
}
}
g<<smax<<' '<<nmin<<endl;
for(i=n;i>0;i--)
{
if(a[i][smax]!=a[i-1][smax])
{
g<<v[i]<<endl;
smax-=v[i];
}
}
}