Pagini recente » Cod sursa (job #209304) | Cod sursa (job #1537213) | Cod sursa (job #701661) | Cod sursa (job #2916179) | Cod sursa (job #3278983)
#include <bits/stdc++.h>
using namespace std;
int n, Gmax, greutate[1001]{}, profit[1001]{}, dp[1001][10001]{}, x;
int main(){
cin >> n >> Gmax;
for(int i = 1; i <= n; i++)
cin >> greutate[i] >> profit[i];
for(int i = 1; i <= n; i++){
for(int j = 1; j <= Gmax; j++){
if(greutate[i] > j)
dp[i][j] = dp[i-1][j];
else
dp[i][j] = max(dp[i-1][j], dp[i-1][j-greutate[i]] + profit[i]);
}
}
cout << dp[n][Gmax];
}