Cod sursa(job #3322070)
| Utilizator | Data | 12 noiembrie 2025 16:21:18 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int main() {
int n, g;
cin >> n >> g;
vector<int> dp(g + 5, 0);
for (int i = 1; i <= n; i++) {
int w, p;
cin >> w >> p;
for (int j = g; (j - w) >= 0; j--) {
dp[j] = max(dp[j], dp[j - w] + p);
}
}
cout << dp[g] << '\n';
}
