Cod sursa(job #2398582)
| Utilizator | Data | 5 aprilie 2019 19:18:40 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int n, g, *v, w, p;
fin >> n >> g;
v = new int[g + 1];
for (int i = 0; i <= g; ++i) {
v[i] = 0;
}
v[0] = 0;
while (n--) {
fin >> w >> p;
for (int i = g - w; i >= 0; --i) {
if (v[i + w] < v[i] + p) {
v[i + w] = v[i] + p;
}
}
}
for (int i = 0; i <= g; ++i) {
if (v[i] > n) {
n = v[i];
}
}
fout << n;
}