Cod sursa(job #2733502)
Utilizator | Data | 30 martie 2021 15:54:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int res[1003][1003];
int w[1003], p[1003];
int main ()
{
int n, i, j, gmax;
f >> n >> gmax;
for (i = 1; i <= n; i += 1)
f >> w[i] >> p[i];
for (i = 1; i <= n; i += 1)
{
for (j = 1; j <= gmax; j += 1)
{
res[i][j] = res[i - 1][j];
if (w[i] <= j)
res[i][j] = max (res[i][j], res[i - 1][j - w[i]] + p[i]);
}
}
g << res[n][gmax];
return 0;
}