Pagini recente » Cod sursa (job #928094) | Cod sursa (job #861580) | Cod sursa (job #2645482) | Borderou de evaluare (job #321260) | Cod sursa (job #3354726)
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
int main() {
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g;
cin >> n >> g;
vector<int> dp(g + 1, 0);
for (int i = 0; i < n; ++i) {
int w, p;
cin >> w >> p;
for (int j = g; j >= w; --j)
dp[j] = max(dp[j], dp[j - w] + p);
}
cout << dp[g] << "\n";
return 0;
}