Cod sursa(job #2999784)
| Utilizator | Data | 11 martie 2023 14:50:45 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
struct obiect{
int w,p;
};
obiect v[5005];
int dp[10005][10005];
int main()
{
int n,g;
fin>>n>>g;
for(int i=1;i<=n;i++)
fin>>v[i].w>>v[i].p;
dp[1][1]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
int lin_c=i%2;
int lin_a=(i-1)%2;
if(j-v[i].w>=0)
dp[lin_c][j]=max(dp[lin_a][j-v[i].w]+v[i].p, dp[lin_a][j]);
}
}
fout<<dp[n][g];
return 0;
}
