Pagini recente » Cod sursa (job #2442134) | Cod sursa (job #3246466) | Cod sursa (job #57433) | Cod sursa (job #2886943) | Cod sursa (job #3130459)
#include <fstream>
using namespace std;
int w[5005],v[5005];
int d[2][10005];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,g;
cin >> n >> g;
for(int i=1;i<=n;i++)
cin >> w[i] >> v[i];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
if(j-w[i]>=0)
d[1][j]=max(d[0][j] , d[0][j-w[i]]+v[i]);
else
d[1][j]=d[0][j];
}
for(int j=0;j<=g;j++)
{
d[0][j]=d[1][j];
d[1][j]=0;
}
}
cout << d[0][g];
return 0;
}