Pagini recente » Cod sursa (job #1101995) | Cod sursa (job #1981633) | Cod sursa (job #1364767) | Cod sursa (job #396166) | Cod sursa (job #2345419)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g, a[2][10001];
bool e;
int main() {
cin >> n >> g;
for(int i=0; i<n; i++, e=!e) {
int g1, p1;
cin >> g1 >> p1;
for(int j=0; j<g1; j++)
b[!e][j] = b[e][j];
for(int j=g1; j<=g; j++)
b[!e][j] = max(b[e][j], p1 + b[e][j - g1]);
}
cout << b[e][g];
return 0;
}