Pagini recente » Cod sursa (job #85798) | Cod sursa (job #3176968) | Cod sursa (job #736866) | Cod sursa (job #1354576) | Cod sursa (job #1648049)
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g,m, 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]<=g)
v[i][j]=max(v[i-1][j], v[i-1][j+w[i]]+p[i]);
m=max(m, v[i][j]);
}
}
/* for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
cout<<setw(4)<<v[i][j]<<" ";
cout<<endl;
}*/
fout<<m;
return 0;
}