Pagini recente » Cod sursa (job #889109) | Cod sursa (job #2133605) | Cod sursa (job #1717636) | Cod sursa (job #1863141) | Cod sursa (job #1648057)
#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[5001][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])
v[i][j]=max(v[i-1][j], v[i-1][j-w[i]]+p[i]);
}
}
/*for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
cout<<setw(4)<<v[i][j]<<" ";
cout<<endl;
}*/
fout<<v[n][g];
return 0;
}