Pagini recente » Cod sursa (job #2570261) | Cod sursa (job #761143) | Cod sursa (job #2531887) | Cod sursa (job #154578) | Cod sursa (job #2401286)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int d[10005];
int main()
{
int n,G,i,g,j,p,last,ans=0;
cin>>n>>G;
for(i=1;i<=G;i++)
d[i]=-1;
last=0;
for(i=1;i<=n;i++)
{
cin>>g>>p;
for(j=last;j>=0;j--)
{
if(d[j]!=-1)
{
if(j+g>G)continue;
if(d[j]+p>d[j+g])
{
d[j+g]=d[j]+p;
if(j+g>last)
last=j+g;
}
}
}
}
for(j=last;j>=1;j--)
if(d[j]>ans)
ans=d[j];
cout<<ans;
return 0;
}