Cod sursa(job #2988277)
| Utilizator | Data | 3 martie 2023 21:54:09 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 5e3 + 1;
int n, g, dp[2][NMAX], w[NMAX], p[NMAX];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin >> n >> g;
for (int i = 1; i <= n; i++)
{
fin >> w[i] >> p[i];
}
int l = 0;
for (int i = 1; i <= n; i++, l = 1 - l)
{
for (int cw = 0; cw <= g; cw++)
{
dp[1 - l][cw] = dp[l][cw];
if (w[i] <= cw)
{
dp[1 - l][cw] = max(dp[1 - l][cw], dp[l][cw - w[i]] + p[i]);
}
}
}
fout << dp[l][g];
}