Pagini recente » Cod sursa (job #1131428) | Cod sursa (job #588914) | Cod sursa (job #2246447) | Cod sursa (job #2005450) | Cod sursa (job #3280042)
#include <iostream>
#define MOD 1000000007
int dp[5001][5001];
int w[5001];
int p[5001];
int main()
{
int n, g;
std::cin >> n >> g;
for(int i = 1; i <= n; i++)
{
std::cin >> w[i] >> p[i];// weight , power
}
for(int i = 1; i <=n ;i++)
{
for(int curg = 0; curg <= g; curg++)
{
//luam rpirma data suma anteriaora
dp[i][curg] = dp[i - 1][curg];
//verif daca nu am intrecut limita de greutate
if(w[i] <= curg)
{
dp[i][curg] = std::max(dp[i][curg], dp[i - 1][curg - w[i]] + p[i]);
}
}
}
std::cout << dp[n][g];
return 0;
}