2323. Find Minimum Time to Finish All Jobs II

Обновлено: 2024-03-12
1 мин
[]

Содержание

LeetCode problem 2323

class Solution:
    def minimumTime(self, jobs: List[int], workers: List[int]) -> int:
        jobs.sort()
        workers.sort()
        return max((a + b - 1) // b for a, b in zip(jobs, workers))