26: 2462. Total Cost to Hire K Workers.py

# problem:
# https://leetcode.com/problems/total-cost-to-hire-k-workers/

# solution:
class Solution:
    def totalCost(self, costs: List[int], k: int, candidates: int) -> int:
        q = costs[:candidates]
        qq = costs[max(candidates, len(costs)-candidates):]
        heapify(q)
        heapify(qq)
        ans = 0 
        i, ii = candidates, len(costs)-candidates-1
        for _ in range(k): 
            if not qq or q and q[0] <= qq[0]: 
                ans += heappop(q)
                if i <= ii: 
                    heappush(q, costs[i])
                    i += 1
            else: 
                ans += heappop(qq)
                if i <= ii: 
                    heappush(qq, costs[ii])
                    ii -= 1
        return ans