Cod sursa(job #2405709)
Utilizator | Preda Armand armandpreda | Data | 14 aprilie 2019 19:45:00 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int DP[10005];
int main()
{
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
int j, i, n, g, pmax = -1, wi, pi;
scanf("%d%d", &n, &g);
for (i = 0; i < n; i++) {
scanf("%d%d", &wi, &pi);
for (j = g - wi; j >= 0; j--) {
if (DP[j] != 0 || j == 0) {
DP[j + wi] = max(DP[j + wi], DP[j] + pi);
}
}
}
for (i = 0; i <= g; i++) {
if (DP[i] > pmax) {
pmax = DP[i];
}
}
printf("%d\n", pmax);
return 0;
}