Pagini recente » Cod sursa (job #1348232) | Cod sursa (job #1645124) | Cod sursa (job #1806356) | Cod sursa (job #2119045) | Cod sursa (job #1462613)
#include <fstream>
using namespace std;
int d[10001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,G,g,p,smax,profit,i,j;
scanf("%d%d",&n,&G);
for(i=1;i<=G;i++)
d[i]=-1;
smax=0;
for(i=1;i<=n;i++)
{
scanf("%d%d",&g,&p);
for(j=smax;j>=0;j--)
if(d[j]!=-1 and j+g<=G)
{
if(d[j+g]<d[j]+p)
d[j+g]=d[j]+p;
if(j+g>smax)
smax=j+g;
}
}
profit=0;
for(i=G;i>=1;i--)
if(d[i]>profit)
profit=d[i];
printf("%d",profit);
return 0;
}