def total_time(heroes: list, n: int):
    heroes.reverse()
    current = []
    for _ in range(n):
        heapq.heappush(current, heroes.pop())
    while heroes:
        x = heapq.heappop(current)
        heapq.heappush(current, x + heroes.pop())
    return max(current)