Cod sursa(job #2960880)
Utilizator | Data | 5 ianuarie 2023 10:06:58 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int Nmax = 5 * 1e3 + 1, Gmax = 1e4 + 1;
int dp[Gmax], aux[Gmax];
int g[Nmax], p[Nmax];
int main()
{
int n, gr, i, j;
fin >> n >> gr;
for(i = 1; i <= n; i++)
fin >> g[i] >> p[i];
for(i = 1; i <= n; i++)
{
for(j = 1; j <= gr; j++)
{
if(j < g[i])
dp[j] = aux[j];
else
dp[j] = max(aux[j], aux[j - g[i]] + p[i]);
}
for(j = 1; j <= gr; j++)
aux[j] = dp[j];
}
fout << dp[gr];
return 0;
}