Pagini recente » Cod sursa (job #663063) | Cod sursa (job #532706) | Cod sursa (job #2366249) | Cod sursa (job #1451158) | Cod sursa (job #949319)
Cod sursa(job #949319)
#include <cstdio>
#include <cstring>
using namespace std;
int v[20005],d[100000],sol[20005];
int main()
{
freopen("ghiozdan.in","r",stdin);
freopen("ghiozdan.out","w",stdout);
int n,g,i,j,max,q=0;
scanf("%d%d",&n,&g);
for(i=1;i<=n;i++) scanf("%d",&v[i]);
memset(d,-1,sizeof(d));
max=0;d[0]=0;
for(i=1;i<=n;i++)
{
for(j=max;j>=0;j--)
{
if(d[j]!=-1)
d[j+v[i]]=d[j]+1;
if(j+v[i]>max)
max=j+v[i];
}
}
while(d[g]==-1) g--;
printf("%d %d",g,d[g]);
return 0;
}