Cod sursa(job #2738790)
| Utilizator | Data | 6 aprilie 2021 12:49:52 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ofstream cout("rucsac.in");
ifstream cin("rucsac.in");
const int MAXN = 5002;
const int MAXG = 10002;
int n, g;
int w[MAXN], p[MAXN];
int d[2][MAXG];
int main()
{
cin >> n >> g;
for(int i=1; i<=n; i++)
cin >> w[i] >> p[i];
for(int i=1; i<=n; i++) {
for(int j=1; j<w[i]; j++)
d[i%2][j] = d[(i-1)%2][j];
for(int j=w[i]; j<=g; j++)
d[i%2][j] = max(d[(i-1)%2][j], d[(i-1)%2][j-w[i]]+p[i]);
}
cout << d[n%2][g];
return 0;
}