Cod sursa(job #1900730)
Utilizator | Data | 3 martie 2017 16:10:13 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int N=5005, G=10005;
int n, g, w[N], v[N], dp[N][G];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;++i)
fin>>w[i]>>v[i];
for(int i=1;i<=n;++i)
for(int j=0;j<=g;++j)
{
if(w[i]>j)dp[i][j]=dp[i-1][j];
else dp[i][j]=max(dp[i-1][j], dp[i-1][j-w[i]]+v[i]);
}
fout<<dp[n][g];
return 0;
}