Pagini recente » Cod sursa (job #1815398) | Cod sursa (job #1237657) | Cod sursa (job #1700367) | Cod sursa (job #341841) | Cod sursa (job #797454)
Cod sursa(job #797454)
#include <stdio.h>
#define LMAX 10005
int n,g,best[LMAX],rez;
inline int max(int x,int y)
{
return x>y ? x : y;
}
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&g);
int i,j,w,p;
for (i=1; i<=n; i++)
{
scanf("%d%d",&w,&p);
for (j=g; j>=0; j--)
if (j+w<=g && best[j+w]<best[j]+p)
best[j+w]=best[j]+p, rez=max(rez,best[j+w]);
}
printf("%d\n",rez);
return 0;
}