Cod sursa(job #3354642)
| Utilizator | Data | 19 mai 2026 16:28:03 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, G;
cin >> N >> G;
vector<int> dp(G + 1, 0);
for (int i = 1; i <= N; i++) {
int w, p;
cin >> w >> p;
for (int g = G; g >= w; g--) {
dp[g] = max(dp[g], dp[g - w] + p);
}
}
cout << dp[G] << "\n";
return 0;
}