Pagini recente » Cod sursa (job #2793489) | Cod sursa (job #2141472) | Cod sursa (job #994435) | Cod sursa (job #1294254) | Cod sursa (job #1892349)
#include<cstdio>
using namespace std;
struct DATA
{
int g,p;
};
DATA v[5005];
int d[10000];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,gmax,maxim=0;
scanf("%d%d",&n,&gmax);
for(int i=1; i<=n; i++)
scanf("%d%d",&v[i].g,&v[i].p);
for(int i=1; i<=n; i++)
for(int j=gmax-v[i].g; j>=0; j--)
{
if(d[j+v[i].g]<d[j]+v[i].p)
{
d[j+v[i].g]=d[j]+v[i].p;
if(d[j+v[i].g]>maxim)
maxim=d[j+v[i].g];
}
}
printf("%d",maxim);
return 0;
}