Cod sursa(job #2791119)
| Utilizator | Data | 30 octombrie 2021 09:38:49 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#define NMAX 5005
#define GMAX 100005
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int w[NMAX], p[NMAX], dp[GMAX];
int n, i, j, nrw, x, sol, i1, i2;
int main()
{
f >> n >> nrw;
for (x = 1; x <= n; ++x)
f >> w[x] >> p[x];
for (i = 1; i <= n; ++i)
for (j = nrw - w[i]; j >= 0; --j)
{
if (dp[j + w[i]] < dp[j] + p[i])
{
dp[j + w[i]] = dp[j] + p[i];
sol = max(sol, dp[j + w[i]]);
}
}
g << sol;
return 0;
}
