Cod sursa(job #2722518)
Utilizator | Data | 12 martie 2021 22:18:28 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#define mF "rucsac"
std::ifstream in(mF ".in");
std::ofstream out(mF ".out");
constexpr int N = 10001; int C[N], D[N], *A = C, *B = D; int main()
{
int n, g; for (in >> n >> g; n--; std::swap(A, B))
{int w, c; in >> w >> c; for (int i = 0; i <= g; i++)
B[i] = i < w? A[i]: std::max(A[i], A[i-w] + c);}
out << A[g];
}