Team Ai
Datasetpublic

FPEvalRepoPublic/LeetCodeMetaData

sourceHugging Faceupdated 9mo agoView on Hugging Face
0likes402downloads
minimum-processing-time.json32 linesDownload Raw Back to root
1{2  "id": 3151,3  "name": "minimum-processing-time",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/minimum-processing-time/",6  "date": "2023-10-01",7  "task_description": "You have a certain number of processors, each having 4 cores. The number of tasks to be executed is four times the number of processors. Each task must be assigned to a unique core, and each core can only be used once. You are given an array `processorTime` representing the time each processor becomes available and an array `tasks` representing how long each task takes to complete. Return the _minimum_ time needed to complete all tasks. **Example 1:** **Input:** processorTime = [8,10], tasks = [2,2,3,1,8,7,4,5] **Output:** 16 **Explanation:** Assign the tasks at indices 4, 5, 6, 7 to the first processor which becomes available at `time = 8`, and the tasks at indices 0, 1, 2, 3 to the second processor which becomes available at `time = 10`. The time taken by the first processor to finish the execution of all tasks is `max(8 + 8, 8 + 7, 8 + 4, 8 + 5) = 16`. The time taken by the second processor to finish the execution of all tasks is `max(10 + 2, 10 + 2, 10 + 3, 10 + 1) = 13`. **Example 2:** **Input:** processorTime = [10,20], tasks = [2,3,1,2,5,8,4,3] **Output:** 23 **Explanation:** Assign the tasks at indices 1, 4, 5, 6 to the first processor and the others to the second processor. The time taken by the first processor to finish the execution of all tasks is `max(10 + 3, 10 + 5, 10 + 8, 10 + 4) = 18`. The time taken by the second processor to finish the execution of all tasks is `max(20 + 2, 20 + 1, 20 + 2, 20 + 3) = 23`. **Constraints:** `1 <= n == processorTime.length <= 25000` `1 <= tasks.length <= 105` `0 <= processorTime[i] <= 109` `1 <= tasks[i] <= 109` `tasks.length == 4 * n`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "processorTime = [8,10], tasks = [2,2,3,1,8,7,4,5]",12      "output": "16 "13    },14    {15      "label": "Example 2",16      "input": "processorTime = [10,20], tasks = [2,3,1,2,5,8,4,3]",17      "output": "23 "18    }19  ],20  "constraints": [21    "1 <= n == processorTime.length <= 25000",22    "1 <= tasks.length <= 105",23    "0 <= processorTime[i] <= 109",24    "1 <= tasks[i] <= 109",25    "tasks.length == 4 * n"26  ],27  "python_template": "class Solution(object):\n    def minProcessingTime(self, processorTime, tasks):\n        \"\"\"\n        :type processorTime: List[int]\n        :type tasks: List[int]\n        :rtype: int\n        \"\"\"\n        ",28  "java_template": "class Solution {\n    public int minProcessingTime(List<Integer> processorTime, List<Integer> tasks) {\n        \n    }\n}",29  "metadata": {30    "func_name": "minProcessingTime"31  }32}