Pagini recente » Cod sursa (job #2942411) | Cod sursa (job #74859) | Cod sursa (job #300012) | Cod sursa (job #1988549) | Cod sursa (job #1604309)
#include<cstdio>
using namespace std;
int v[10002];
int main ()
{
int n,g,i,x,y,j,maxim=0;
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&g);
for(i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
for(j=g;j>=1;j--)
if(v[j]!=0)
if(j+x<=g&&v[j]+y>v[j+x])
v[j+x]=v[j]+y;
if(y>v[x])
v[x]=y;
}
for(i=1;i<=g;i++)
if(v[i]>maxim)
maxim=v[i];
printf("%d",maxim);
return 0;
}