Cod sursa(job #3354679)
| Utilizator | Data | 19 mai 2026 18:57:06 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <vector>
using namespace std;
int main() {
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g;
fin >> n >> g;
vector<int> w(n + 1);
vector<int> p(n + 1);
for (int i = 1; i <= n; i++) {
fin >> w[i] >> p[i];
}
vector<int> dp(g + 1, 0);
for (int i = 1; i <= n; i++) {
for (int j = g; j >= 0; j--) {
if (j - w[i] < 0) continue;
dp[j] = max(dp[j], dp[j - w[i]] + p[i]);
}
}
fout << dp[g];
fin.close();
fout.close();
return 0;
}