Cod sursa(job #3264898)
| Utilizator | Data | 25 decembrie 2024 14:54:27 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#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] << " ";
}
