Cod sursa(job #2950379)
Utilizator | Data | 3 decembrie 2022 16:39:41 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int n,G,gr[5010],pr[5010],pmax=0;
int dp[5010][10010];
int i,j;
fin>>n>>G;
for(i=1; i<=n; i++)
fin>>gr[i]>>pr[i];
for(i=1; i<=n; i++)
for(j=0; j<=G; j++)
if (gr[i]>j)
dp[i][j]=dp[i-1][j];
else
dp[i][j]=max(dp[i-1][j],dp[i-1][j-gr[i]]+pr[i]);
fout<<dp[n][G];
}