Cod sursa(job #3253660)
| Utilizator | Data | 4 noiembrie 2024 08:35:54 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,w[5005],c[5005],dp[5][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[2])
dp[2][k]=max(dp[1][k], dp[1][k-w[2]]+c[2]);
else dp[2][k]=dp[1][k];
if(i>2)
for(int k=0;k<=G;k++)
swap(dp[1][k],dp[2][k]),dp[2][k]=0;
}
fout<<dp[2][G];
return 0;
}
