Pagini recente » Borderou de evaluare (job #3014342) | Cod sursa (job #3234852) | Cod sursa (job #1614045) | Cod sursa (job #1641013) | Cod sursa (job #2562930)
#include <iostream>
#include <fstream>
using namespace std;
int m[5001][10001];
int main()
{
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int v[5001],c[5001];
int g,n;
fin>>n>>g;
for(int i=1; i<=n; i++)
{
fin>>v[i]>>c[i];
for(int j=1; j<=g; j++)
if(v[i]<=j)
m[i][j]=max(m[i-1][j-v[i]]+c[i],m[i-1][j]);
}
fout<<m[n][g];
return 0;
}