Pagini recente » Cod sursa (job #1579331) | Cod sursa (job #2640166) | Cod sursa (job #451875) | Autentificare | Cod sursa (job #1668232)
#include <fstream>
#include <vector>
#include <algorithm>
#define NMAX 300001
using namespace std;
int sol[3001];
int main()
{
int n, maxG, x, y;
int g[NMAX], p[NMAX];
ifstream f("ruksak.in");
f >> n >> maxG;
for (int i = 1; i <= n; i++)
{
f >> g[i] >> p[i];
}
f.close();
int k, c;
for (int i = 1; i <= n; i++)
{
for (int j = maxG - g[i]; j >= 0; j--)
{
sol[j + g[i]] = max(sol[j + g[i]], sol[j] + p[i]);
}
}
ofstream gout("ruksak.out");
gout << sol[maxG];
gout.close();
return 0;
}