Pagini recente » Cod sursa (job #2900074) | Cod sursa (job #2760240) | Cod sursa (job #2951028) | Cod sursa (job #2509025) | Cod sursa (job #1207391)
#include <cstdio>
#define NMAX 50001
#define GMAX 10001
using namespace std;
int n, g, p[NMAX], w[NMAX];
//int m[NMAX][GMAX];
int m[2][GMAX];
int max(int a, int b) {
if (a < b) {
return b;
}
return a;
}
int main() {
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
scanf("%d %d", &n, &g);
for (int i = 1; i <= n; ++i) {
scanf("%d %d", &w[i], &p[i]);
}
int t = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= g; ++j) {
if (w[i] <= j) {
//m[i][j] = max(m[i-1][j], m[i-1][j-w[i]] + p[i]);
m[t][j] = max(m[1-t][j], m[1-t][j-w[i]] + p[i]);
} else {
//m[i][j] = m[i-1][j];
m[t][j] = m[1-t][j];
}
}
t = 1 - t;
}
printf("%d \n", m[1-t][g]);
return 0;
}