Cod sursa(job #2628192)
Utilizator | Data | 14 iunie 2020 20:52:41 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 35 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
with open("rucsac.in", "r") as f, open("rucsac.out", "w") as g:
n, G = (int(i) for i in next(f).split())
m = max
a = [0] * (G + 1)
for i in range(n):
w, p = (int(j) for j in next(f).split())
for j in range(G, w - 1, -1):
a[j] = m(a[j], a[j - w] + p)
g.write(str(a[G]))