Pagini recente » Cod sursa (job #2435612) | Cod sursa (job #2021541) | Cod sursa (job #2107300) | Cod sursa (job #974429) | Cod sursa (job #2930340)
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n,g,i,j,h,maxc,a[5005],b[5005],f[10005];
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)
{
h=j+a[i];
if (h<=g)
{
if (f[j]+b[i]>f[h])
f[h]=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;
}