Pagini recente » Cod sursa (job #2119575) | Cod sursa (job #655620) | Cod sursa (job #819144) | Cod sursa (job #1039672) | Cod sursa (job #1428563)
#include <cstdio>
using namespace std;
int d[10005];
int main()
{ freopen("rucsac.in", "r",stdin);
freopen("rucsac.out", "w",stdout);
int n,gmax,i,dr=0,g,p,j,max=0;
scanf("%d%d",&n,&gmax);
for(i=1;i<=gmax;i++)
d[i]=-1;
for(i=1;i<=n;i++)
{
scanf("%d%d",&g,&p);
for(j=dr;j>=0;j--)
{
if(j+g<=gmax)
{
if(d[j]!=-1)
{
if(d[j+g]<d[j]+p)
{
d[j+g]=d[j]+p;
if(j+g>dr)
dr=j+g;
}
}
}
}
}
for(i=1;i<=gmax;i++)
if(max<d[i])
max=d[i];
printf("%d\n", max);
return 0;
}