Pagini recente » Cod sursa (job #1159502) | Cod sursa (job #497796) | Cod sursa (job #3260625) | Cod sursa (job #1414269) | Cod sursa (job #1947349)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int p[5005],w[5005],i,j,n,g,t[2][12005];
int main()
{
fin>>n>>g;
for (i=1; i<=n; i++)
fin>>w[i]>>p[i];
for (i=1; i<=n; i++)
{
for (j=1; j<=g; j++)
{
if (w[i]>j) t[1][j]=t[0][j]; else
t[1][j]=max(t[0][j-w[i]]+p[i],t[0][j]);
}
for (j=1; j<=g; j++)
t[0][j]=t[1][j];
}
fout<<t[1][g];
}