Cod sursa(job #3253656)
| Utilizator | Data | 4 noiembrie 2024 08:24:42 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,w[5005],c[5005],dp[5005][10005];
int main()
{
fin>>n>>G;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>c[i];
}
memset(dp, 0, sizeof(dp));
for(int i=1;i<=n;i++)
for(int k=0;k<=G;k++)
if(k>=w[i])
dp[i][k]=max(dp[i-1][k], dp[i-1][k-w[i]]+c[i]);
else dp[i][k]=dp[i-1][k];
fout<<dp[n][G];
return 0;
}
