Cod sursa(job #3354726)
| Utilizator | Data | 20 mai 2026 00:25:02 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#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;
}