Pagini recente » Cod sursa (job #2819874) | Cod sursa (job #608219) | Cod sursa (job #2299265) | Profil ariba021 | Cod sursa (job #3264898)
#include <bits/stdc++.h>
using namespace std;
struct item {
int w, p;
} v[5001];
int n, g;
int dp[5001][10001];
int main() {
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
cin >> n >> g;
for (int i = 1; i <= n; ++i) {
cin >> v[i].w >> v[i].p;
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= g; ++j) {
dp[i][j] = dp[i - 1][j];
if (j >= v[i].w) {
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i].w] + v[i].p);
}
}
}
cout << dp[n][g] << " ";
}