Pagini recente » Cod sursa (job #1052089) | Cod sursa (job #1688036) | Cod sursa (job #658152) | Cod sursa (job #290481) | Cod sursa (job #1284022)
#include <iostream>
#include <cstdio>
using namespace std;
int G,n;
int d[5001][10001];
struct obiect{
int p,w;
}obj[5001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&G);
for(int i=1;i<=n;i++)
scanf("%d%d",&obj[i].w,&obj[i].p);
for(int i=1;i<=n;i++)
{
for(int g=0;g<=G;g++)
{
if(obj[i].w<=g)
{
d[i][g]=max(obj[i].p+d[i-1][g-obj[i].w],d[i-1][g]);
}
else
{
d[i][g]=d[i-1][g];
}
}
}
printf("%d\n",d[n][G]);
return 0;
}