Pagini recente » Cod sursa (job #883939) | Istoria paginii runda/eusebiu_oji_2018_cls10/clasament | Cod sursa (job #62271) | Istoria paginii runda/train-hard | Cod sursa (job #2199749)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int w[1005], p[1005], dp[5005];
int main()
{
int n, G;
fin >> n >> G;
for(int i = 0; i < n; i++)
fin >> w[i] >> p[i];
for(int i = 0; i < n; i++) {
for(int j = G; j >= w[i]; j--) {
dp[j] = max(dp[j], p[i] + dp[j - w[i]]);
}
}
fout << dp[G];
return 0;
}