Cod sursa(job #3153032)
Utilizator | Data | 27 septembrie 2023 19:21:45 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
using namespace std;
struct obiecte {
int w;
int p;
};
obiecte ob[5000];
int v[10000];
int main()
{
int n, g;
cin >> n >> g;
for (int i = 0; i < n; i++) {
cin >> ob[i].w >> ob[i].p;
}
for (int i = 0; i < n; i++) {
int w = ob[i].w;
int p = ob[i].p;
for (int j = g; j >= w; j--) {
v[j] = max(v[j], v[j - w] + p);
}
}
cout << v[g];
}