Pagini recente » Cod sursa (job #1791808) | Cod sursa (job #1933339) | Cod sursa (job #1021331) | Cod sursa (job #386750) | Cod sursa (job #1462604)
#include <cstdio>
using namespace std;
int d[5001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,i,G,g,p,smax=0,max=0,j;
scanf("%d%d",&n,&G);
for(i=1;i<=n;i++)
{
scanf("%d%d",&g,&p);
for(j=smax;j>=0;j--)
{
if(d[j]!=-1 && j+g<=G)
if(d[j+g]<d[j]+p)
d[j+g]=d[j]+p;
if(j+g>smax) smax=j+g;
}
}
for(i=G;i>=1;i--)
if(max<d[i]) max=d[i];
printf("%d\n",max);
return 0;
}