Pagini recente » Borderou de evaluare (job #2487788) | Cod sursa (job #3188361) | Cod sursa (job #2239651) | Cod sursa (job #728143) | Cod sursa (job #748475)
Cod sursa(job #748475)
#include<cstdio>
using namespace std;
int ai,n,nr,s,maxi,gm,i,l1,l,j,a[20002],b[75002],ap[75002],ap1[202];
int main()
{
freopen("ghiozdan.in","r",stdin);
freopen("ghiozdan.out","w",stdout);
scanf("%d",&n);
scanf("%d",&gm);
l=1;
b[1]=0;
ap[0]=-1;
for(i=1;i<=n;i++)
{
scanf("%d",&ai);
ap1[ai]++;
}
//sort(a+1,a+n+1);
nr=0;
for(i=1;i<=200;i++)
for(j=1;j<=ap1[i];j++)
{
nr++;
a[nr]=i;
}
for(i=n;i>=1;i--)
{
l1=l;
for(j=1;j<=l1;j++)
if(b[j]+a[i]<=gm&&ap[b[j]+a[i]]==0)
{
ap[b[j]+a[i]]=i;
if(b[j]+a[i]>maxi) maxi=b[j]+a[i];
l++;
b[l]=b[j]+a[i];
}
}
printf("%d ",maxi);
nr=0;
s=maxi;
while(1)
{
if(s==0) break;
nr++;
b[nr]=a[ap[s]];
s=s-a[ap[s]];
}
//sort(b+1,b+nr+1);
printf("%d\n",nr);
for(i=1;i<=nr;i++)
printf("%d\n",b[i]);
return 0;
}