Cod sursa(job #2792196)
| Utilizator | Data | 1 noiembrie 2021 08:48:55 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[5001],p[5001],dp[2][10001];
int main()
{
int n,g,lin=0;
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
for(int i=1;i<=n;i++)
{
for(int j=0;j<=g;j++)
{
dp[1-lin][j]=dp[lin][j];
if(w[i]<=j)
dp[1-lin][j]=max(dp[1-lin][j], dp[lin][j-w[i]]+p[i]);
}
lin=1-lin;
}
fout<<dp[lin][g];
}
