Cod sursa(job #2503482)
Utilizator | Data | 3 decembrie 2019 11:32:44 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
fin = open("rucsac.in","r")
fout = open("rucsac.out","w")
N = int(fin.readline())
v = []
G = int(fin.readline())
for i in range(N):
w = int(fin.readline())
p = int(fin.readline())
v.append([p, w])
v.sort(reverse=True)
Pmax = 0
for i in range(N):
if v[i][1] <= G:
Pmax = Pmax + v[i][0]
G = G - v[i][1]
fout.write(str(Pmax))
fin.close()
fout.close()