Pagini recente » Cod sursa (job #1482132) | Cod sursa (job #229326) | Cod sursa (job #1146834) | Cod sursa (job #156134) | Cod sursa (job #2714775)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n,g,d[10005][10005];
int main()
{
fin >>n >> g;
int w,p;
for(int i=1;i<=n;++i)
{
fin >> w >> p;
for(int j=0;j<w;++j)
{
d[i][j]=d[i-1][j];
}
for(int j=w;j<=g;++j)
{
d[i][j]=max(d[i-1][j-w]+p,d[i-1][j]);
}
}
fout << d[n][g];
return 0;
}