Pagini recente » Cod sursa (job #1876596) | Cod sursa (job #1449233) | Cod sursa (job #2093358) | Cod sursa (job #1620502) | Cod sursa (job #2491380)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,gm,i,j,maxim,m,g[5005],p[5005],d[10005];
int main()
{
fin >> n >> gm;
for (i=1;i<=n;i++) fin >> g[i] >> p[i];
m=max(gm,n);
for (i=1;i<=m;i++) d[i]=-1;
for (i=1;i<=n;i++) for (j=gm;j>=0;j--)
{
if (d[j]!=-1 && j+g[i]<=gm)
{
d[j+g[i]]=max(d[j+g[i]],d[j]+p[i]);
maxim=max(maxim,d[j+g[i]]);
}
}
fout << maxim;
return 0;
}