Pagini recente » Cod sursa (job #734545) | Cod sursa (job #2078223) | Cod sursa (job #1294860) | Cod sursa (job #1496618) | Cod sursa (job #1785963)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ghiozdan.in");
ofstream g("ghiozdan.out");
int n,gg,w,v[20010],q[75010],a[20010],i,j;
int main()
{
f>>n>>gg;
for(i=1;i<=n;++i)
{
f>>v[i];
}
for(i=1;i<=n;++i)
{
if(q[v[i]]==0)
{
q[v[i]]=i;
}
for(j=1;j<=gg;++j)
{
if(q[j]<i && q[j]!=0)
{
q[v[i]+j]=i;
}
}
}
while(q[gg]==0)
{
--gg;
}
g<<gg<<" ";
while(gg!=0)
{
w++;
a[w]=v[q[gg]];
gg=gg-v[q[gg]];
}
g<<w<<"\n";
for(i=w;i>=1;--i)
{
g<<a[i]<<"\n";
}
return 0;
}