Cod sursa(job #2310967)
Utilizator | Data | 2 ianuarie 2019 14:10:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N, G, w, p, i, j, v[10001];
int main() {
fin >> N >> G;
for (i = 1; i <= N; i++) {
fin >> w >> p;
for (j = G; j >= w; j--) {
v[j] = max(v[j - w] + p, v[j]);
}
}
fout << v[G];
return 0;
}