Cod sursa(job #2635320)
Utilizator | Delureanu Ana-Maria A.D.A | Data | 14 iulie 2020 08:40:16 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
#define mmax 10005
int best[mmax][mmax], n, p[mmax], w[mmax],wmax;
int main()
{
fin >> n >> wmax;
for (int i = 1; i <= n; i++)
{
fin >> w[i] >> p[i];
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= wmax; j++)
{
best[i][j] = best[i - 1][j];
if (w[i]<=j)
best[i][j] = max(best[i - 1][j], best[i - 1][j - w[i]] + p[i]);
}
}
fout << best[n][wmax];
}