Cod sursa(job #3354254)
| Utilizator | Data | 17 mai 2026 00:59:54 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
int main() {
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int weight, n;
fin >> n >> weight;
vector<int> w(n), value(n);
for (int i = 0; i < n; i++) {
fin >> w[i] >> value[i];
}
vector<int> dp(weight + 1, 0);
for (int i = 0; i < n; i++) {
for (int j = weight; j >= w[i]; j--) {
dp[j] = max(dp[j], dp[j - w[i]] + value[i]);
}
}
fout << dp[weight] << "\n";
fin.close();
fout.close();
return 0;
}