Pagini recente » Cod sursa (job #2099893) | Cod sursa (job #2840447) | Cod sursa (job #1029039) | Cod sursa (job #2556238) | Cod sursa (job #1648063)
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, w[5001], p[5001], v[2][10001];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
if(j-w[i]>=0)
v[1][j]=max(v[0][j], v[0][j-w[i]]+p[i]);
}
for(int j=1;j<=g;j++) v[0][j]=v[1][j];
}
/*for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
cout<<setw(4)<<v[i][j]<<" ";
cout<<endl;
}*/
fout<<v[1][g];
return 0;
}