Pagini recente » Cod sursa (job #889718) | Cod sursa (job #1268548) | Cod sursa (job #1337071) | Cod sursa (job #2010906) | Cod sursa (job #2009442)
#include <iostream>
#include <fstream>
using namespace std;
int n,G,g[5002],v[5002],d[2][10002],i,j,mx,ic,ip;
int main()
{
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
fin>>n>>G;
for(i=1;i<=n;i++)
{
fin>>g[i]>>v[i];
}
for(i=0;i<=n;i++)
{
ic=i%2;
ip=1-ic;
for(j=0;j<=G;j++)
{
d[ic][j]=max(d[ic][j],d[ip][j]);
if(j+g[i]<=G)d[ic][j+g[i]]=d[ip][j]+v[i];
if(d[ic][j]>mx)mx=d[ic][j];
}
}
fout<<mx;
return 0;
}