Pagini recente » Cod sursa (job #2108964) | Cod sursa (job #2048246) | Cod sursa (job #1821941) | Cod sursa (job #3175091) | Cod sursa (job #1327098)
#include <stdio.h>
#include <stdlib.h>
int e[10001];
int v[10001];
int m(int x,int y)
{
if(x>y)
return x;
return y;
}
int main()
{
int n,g,i,w,p,j,max;
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&g);
e[0]=1;
for(i=1; i<=n; i++)
{
scanf("%d%d",&w,&p);
for(j=g-w; j>=0; j--)
if(e[j]==1)
v[j+w]=m(v[j+w],v[j]+p),e[j+w]=1;
}
max=0;
for(i=1; i<=g; i++)
if(v[i]>max)
max=v[i];
printf("%d",max);
return 0;
}