Cod sursa(job #2730913)
Utilizator | Data | 26 martie 2021 23:57:21 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
f = open("deque.in", "r")
g = open("deque.out", "w")
n = int(f.readline(1))
o = int(f.readline(2))
l = f.read().splitlines()
a = 1
suma = 0
for j in range(1, n + 2 - o):
min = int(l[j])
for k in range(j + 1 , j + o):
if int(l[k]) < min:
min = int(l[k])
suma += min
g.write(str(suma))