Pagini recente » Cod sursa (job #2193074) | Cod sursa (job #223580) | Cod sursa (job #2831044) | Cod sursa (job #3164087) | Cod sursa (job #1446624)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
int a[2][10001], g, gmax, p, n, i, j;
int main() {
fi >> n >> gmax;
for(i = 1; i <= n; i++) {
fi >> g >> p;
for(j = 1; j <= gmax; j++)
if(j >= g && p + a[0][j - g] > a[1][j])
a[1][j] = a[0][j - g] + p;
else a[1][j] = a[0][j];
for(j = 0; j <= gmax; j++) a[0][j] = a[1][j];
}
fo << a[1][gmax];
return 0;
}