프로그래머스 - 택배 배달과 수거하기 (L2)

 1def solution(cap, n, deliveries, pickups):
 2    answer = 0
 3    tempD = 0
 4    tempP = 0
 5    for i in range(n-1, -1, -1):
 6        tempD += deliveries[i]
 7        tempP += pickups[i]
 8        
 9        while tempD > 0 or tempP > 0:
10            tempD -= cap
11            tempP -= cap
12            answer += (i+1)*2
13    return answer