Cod sursa(job #2672561)
Utilizator | Data | 14 noiembrie 2020 10:55:47 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
const int nmax = 5000, gmax=10000;
int i, j, n, g, p[nmax], w[nmax], dp[nmax][gmax];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
fin>>n>>g;
for(i=1; i<=n; i++)
fin >> w[i] >> p[i];
for(i=1; i<=n; i++) {
for(j=1; j<w[i]; j++)
dp[i][j]=dp[i-1][j];
for(j=w[i]; j<=g; j++)
dp[i][j]=max(dp[i-1][j], dp[i-1][j-w[i]]+p[i]);
}
fout << dp[n][g];
return 0;
}