Pagini recente » Cod sursa (job #698671) | Cod sursa (job #602735) | Cod sursa (job #3244517) | Cod sursa (job #2717397)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, w[5005], p[5005];
int main() {
fin >> n >> g;
for(int i = 1; i <= n; i++)
fin >> w[i] >> p[i];
int mx = 0;
vector<vector<int> > dp(2, vector<int> (g+1, 0));
for(int i = 1; i <= n; i++)
for(int j = 0; j <= g; j++) {
dp[i%2][j] = dp[1-i%2][j];
if(j >= w[i])
dp[i%2][j] = max(dp[i%2][j], dp[1-i%2][j-w[i]]+p[i]);
mx = max(mx, dp[i%2][j]);
}
fout << mx;
}