Cod sursa(job #644467)
Utilizator | Cioboata Ioan Liviu cioboata.i | Data | 6 decembrie 2011 19:34:17 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
int sol[10001],g[5001],p[5001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,G,i,j,max;
scanf("%d%d",&n,&G);
sol[0]=0;
for(i=1;i<=G;i++)
sol[i]=-1;
for(i=1;i<=n;i++)
scanf("%d%d",&g[i],&p[i]);
for(i=1;i<=n;i++)
{
for(j=G-g[i];j>=0;j--)
if(sol[j]+p[i]>sol[j+g[i]])
sol[j+g[i]]=sol[j]+p[i];
}
max=-1;
for(i=1;i<=G;i++)
if(sol[i]>max)
max=sol[i];
printf("%d",max);
return 0;
}