Cod sursa(job #2116172)
Utilizator | Data | 27 ianuarie 2018 13:07:28 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
int n,g,i,j,W,P;
int dp[2][10001];
int main()
{
fi>>n>>g;
for(i=1;i<=n;i++){
fi>>W>>P;
for(j=1;j<=g;j++)
dp[0][j]=dp[1][j];
for(j=1;j<=g;j++){ if(W<=j) dp[1][j]=max(dp[0][j],dp[0][j-W]+P);
}
}
fo<<dp[1][g];
return 0;
}