Pagini recente » Cod sursa (job #1968607) | Cod sursa (job #2198895) | Cod sursa (job #1625080) | Cod sursa (job #1636357) | Cod sursa (job #2345424)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g, a[2][10001];
bool e = 1;
int main() {
cin >> n >> g;
while(n--) {
e = !e;
int g1, p1;
cin >> g1 >> p1;
for(int i=0; i<g1; i++)
a[!e][i] = a[e][i];
for(int i=g1; i<=g; i++)
a[!e][i] = max(a[e][i], p1 + a[e][i - g1]);
}
cout << a[e][g];
return 0;
}