Cod sursa(job #3162219)
| Utilizator | Data | 28 octombrie 2023 16:46:14 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[10005][10005];
struct obiect{
int w,p;
}v[5005];
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]);
else
dp[lin_c][j]=dp[lin_a][j];
}
fout<<dp[n%2][g];
return 0;
}
