Cod sursa(job #3344514)
| Utilizator | Data | 2 martie 2026 10:49:39 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
int main()
{
short n, g;
std::ifstream in("rucsac.in");
in >> n >> g;
short w[n], p[n];
for (short i = 0; i < n; i++)
in >> w[i] >> p[i];
in.close();
int dp[g + 1]{};
for (short i = 0; i < n; i++)
for (short j = g; w[i] <= j; j--)
dp[j] = std::max(dp[j], dp[j - w[i]] + p[i]);
std::ofstream out("rucsac.out");
out << dp[g];
out.close();
return 0;
}