Pagini recente » Cod sursa (job #2922813) | Cod sursa (job #2497152) | Cod sursa (job #1903799) | Cod sursa (job #1560424) | Cod sursa (job #2407386)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int NMAX=10000;
int d[NMAX+5];
int main()
{
int n,G,i,j,g,p,last,ans;
fin>>n>>G;
for(i=1;i<=G;i++)
d[i]=-1;
last=0;
for(i=1;i<=n;i++)
{
fin>>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;
}
}
}
}
ans=0;
for(j=G;j>=1;j--)
if(d[j]>ans)
ans=d[j];
fout<<ans;
fin.close();
fout.close();
return 0;
}