Pagini recente » Cod sursa (job #2433099) | Cod sursa (job #541481) | Cod sursa (job #2315260) | Cod sursa (job #2444498) | Cod sursa (job #642240)
Cod sursa(job #642240)
#include<cstdio>
const int min=-1;
int sol[10001],g[5001],p[5001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,G,i,max,j;
scanf("%d%d",&n,&G);
for(i=1;i<=n;i++)
scanf("%d%d",&g[i],&p[i]);
sol[0]=0;
for(i=1;i<=G;i++)
sol[i]=min;
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;
}