Cod sursa(job #2554986)
Utilizator | Data | 23 februarie 2020 16:15:35 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,w,p,i,j;
int dp[5001][10001];
int main()
{
fin>>n>>g;
for(i=1; i<=n; i++)
{
fin>>w>>p;
for(j=1; j<=g; j++)
{
if(j>=w)
dp[i][j]=max(dp[i-1][j-w]+p,dp[i-1][j]);
else dp[i][j]=dp[i-1][j];
}
}
fout<<dp[n][g];
}