Thời gian tối thiểu để hoàn thành công việc

def min_time_opt(jobs, k):
    def can_finish(limit):
        workers = [0] * k
        def solve(i):
            if i == len(jobs): return True
            for j in range(k):
                if workers[j] + jobs[i] <= limit:
                    workers[j] += jobs[i]
                    if solve(i + 1): return True
                    workers[j] -= jobs[i]
                if workers[j] == 0: break
            return False
        return solve(0)
    jobs.sort(reverse=True)
    l, r = max(jobs), sum(jobs); res = r
    while l <= r:
        m = (l + r) // 2
        if can_finish(m): res = m; r = m - 1
        else: l = m + 1
    return res

def min_time_brute(jobs, k):
    res = float('inf')
    def solve(i, workers):
        nonlocal res
        if i == len(jobs): res = min(res, max(workers)); return
        for j in range(k):
            workers[j] += jobs[i]; solve(i + 1, workers); workers[j] -= jobs[i]
    solve(0, [0]*k); return res