Cod sursa(job #3341984)
| Utilizator | Data | 22 februarie 2026 12:39:36 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int G,i,n,w[5005],p[5005],dp[2][5005],cw,maxi;
int main()
{
fin >> n >> G;
for(i = 1;i<=n;i++){
fin >> w[i] >> p[i];
}
for(i = 1;i<=n;i++){
for(cw = 1;cw<=G;cw++){
dp[i%2][cw]=dp[1-i%2][cw];
if(w[i]<=cw){
dp[i%2][cw]=max(dp[i%2][cw],dp[1-i%2][cw-w[i]]+p[i]);
}
}
}
for(i = 1;i<=G;i++){
if(maxi<dp[n%2][i]){
maxi = dp[n%2][i];
}
}
fout << maxi;
return 0;
}
