Cod sursa(job #3275815)
| Utilizator | Data | 11 februarie 2025 19:56:51 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
int dp[3][10005], c[5005], w[5005];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g;
cin >> n >> g;
for(int i = 1; i <= n; i++){
cin >> w[i] >> c[i];
}
for(int i = 1; i <= n; i++){///obiectele
for(int j = 0; j <= g; j++){///greutatile
if(w[i] <= j){
dp[2][j] = max(dp[1][j], (dp[1][j - w[i]] + c[i]));
}else{
dp[2][j] = dp[1][j];
}
}
for(int j = 0; j <= g; j++){
dp[1][j] = dp[2][j];
}
}
cout << dp[2][g];
return 0;
}
