Pagini recente » Cod sursa (job #2911298) | Cod sursa (job #2507685) | Cod sursa (job #1680346) | Cod sursa (job #2068480) | Cod sursa (job #2190814)
#include <cstdio>
#define max(a, b) a >= b ? a : b
using namespace std;
int n, g, sol, w[10002], p[10002], d[10002][10002];
int main()
{
FILE *in, *out;
in = freopen("rucsac.in", "r", stdin);
out = freopen("rucsac.out", "w", stdout);
scanf("%d%d", &n, &g);
for (int i = 1; i <= n; ++i) scanf("%d%d", &w[i], &p[i]);
fclose(in);
for (int i = 1; i <= n; ++i)
for (int cw = 0; cw <= g; ++cw) {
d[i][cw] = d[i - 1][cw];
if (w[i] <= cw) d[i][cw] = max(d[i][cw], d[i - 1][cw - w[i]] + p[i]);
}
sol = d[n][g];
printf("%d", sol);
fclose(out);
return 0;
}