Pagini recente » Cod sursa (job #2466603) | Cod sursa (job #2405318) | Cod sursa (job #2603019) | Cod sursa (job #2636151) | Cod sursa (job #1215827)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
#define MXN 5001
#define MXG 10001
int n,g;
int w[MXN] , p[MXG];
long v[MXN];
int rucsac(int a , int b)
{
for(int i = 1; i <= n; i++)
for(int j = b; j >= w[i]; j--)
v[j] = max(v[j] , v[j - w[i]] + p[i]);
return v[g];
}
int main()
{
fin >> n >> g;
for(int i= 1; i <= n; i++)
fin >> w[i] >> p[i];
fout << rucsac(n,g);
fin.close();
fout.close();
return 0;
}