Cod sursa(job #2398568)
| Utilizator | Data | 5 aprilie 2019 18:59:20 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 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] = -1;
}
v[0] = 0;
while (n--) {
fin >> w >> p;
for (int j = 0, sj = g - w, u = -1; j <= sj; ++j) {
if (v[j] != -1 && u != j) {
if (v[j + w] < v[j] + p) {
v[j + w] = v[j] + p;
u = j + w;
}
}
}
}
for (int i = 0; i <= g; ++i) {
if (v[i] > n) {
n = v[i];
}
}
fout << n;
}
