Cod sursa(job #3313858)
| Utilizator | Data | 7 octombrie 2025 09:49:00 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
struct jd{
int p, w;
};
jd v[5005];
int dp[2][10005];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g;
cin >> n >> g;
for(int i = 1; i <= n; i++){
cin >> v[i].w >> v[i].p;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= g; j++){
dp[1][j] = dp[0][j];
if(v[i].w <= j){
dp[1][j] = max(dp[1][j], dp[0][j - v[i].w] + v[i].p);
}
}
for(int j = 1; j <= g; j++){
dp[0][j] = dp[1][j];
}
}
cout << dp[1][g];
return 0;
}
