Pagini recente » Cod sursa (job #11237) | Cod sursa (job #884629) | Cod sursa (job #1307040) | Cod sursa (job #2499265) | Cod sursa (job #3233697)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, i, j, g, gr[10002], pr[10002];
int d[2][10002];
int main() {
ios_base::sync_with_stdio(false);
fin.tie(nullptr);
fout.tie(nullptr);
fin >> n >> g;
for(i = 1; i <= n; i++) fin >> gr[i] >> pr[i];
for(i = 1; i <= n; i++) {
for(j = 1; j <= g; j++) {
int p1 = (i & 1);
int p2 = ((i - 1) & 1);
d[p1][j] = d[p2][j];
if(gr[i] <= j) d[p1][j] = max(d[p1][j], d[p2][j - gr[i]] + pr[i]);
}
}
fout << d[n & 1][g];
return 0;
}