Pagini recente » Cod sursa (job #2824345) | Cod sursa (job #2119271) | Cod sursa (job #946504) | Cod sursa (job #703765) | Cod sursa (job #2770515)
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n,g,i,j,maxc,a[5001],b[5001],f[10001];
int main()
{
fin>>n>>g;
for (i=1; i<=n; i++)
fin>>a[i]>>b[i];
for (i=1; i<=n; i++)
{
for (j=g; j>0; j--)
{
if (f[j]!=0)
{
if (j+a[i]<=g)
{
if (f[j]+b[i]>f[j+a[i]])
f[j+a[i]]=f[j]+b[i];
}
}
}
if (a[i]<=g&&b[i]>f[a[i]])
f[a[i]]=b[i];
}
for (i=1; i<=g; i++)
{
if (f[i]>maxc)
maxc=f[i];
}
fout<<maxc;
return 0;
}