Pagini recente » Cod sursa (job #2854666) | Cod sursa (job #2235574) | Cod sursa (job #1073258) | Cod sursa (job #1331307) | Cod sursa (job #2471307)
#include <fstream>
using namespace std;
const int GMAX=10000;
int d[GMAX+5];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int i,jn,G,n,g,p,last,pmax,j;
fin>>n>>G;
last=0;
for(i=1;i<=G;i++)
d[i]=-1;
for(i=1;i<=n;i++)
{
fin>>g>>p;
for(j=last;j>=0;j--)
{
if(j+g>G) continue;
if(d[j]!=-1)
{
jn=j+g;
if(d[jn]<d[j]+p)
{
d[jn]=d[j]+p;
if(jn>last)
last=jn;
}
}
}
}
pmax=0;
for(i=1;i<=G;i++)
if(d[i]>pmax)
pmax=d[i];
fout<<pmax<<"\n";
fin.close();
fout.close();
return 0;
}