Pagini recente » Cod sursa (job #2797318) | Cod sursa (job #120477) | Cod sursa (job #1336843) | Cod sursa (job #2202788) | Cod sursa (job #3259466)
#include <bits/stdc++.h>
using namespace std;
#define lol long long
/*
6 10
3 7
3 4
1 2
1 9
2 4
1 5
*/
lol dp[5000][10000];
int main()
{
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
lol n , g;
cin >> n >> g;
vector<lol> w(n+1 , 0);
vector<lol> p(n+1 , 0);
for(lol i = 1; i <= n; i++){
cin >> w[i] >> p[i];
}
for(lol i = 1; i <= n; i++){
for(lol cw = 1; cw <= g;cw++){
dp[i][cw] = dp[i-1][cw];
if(cw- w[i] >= 0) dp[i][cw] = max(dp[i-1][cw], dp[i-1][cw - w[i]] + p[i]);
}
}
cout << dp[n][g] << "\n";
return 0;
}