Minimum Time to Execute Processes

Problem Statement

Minimum Time to Execute Processes Problem Description There are n processes to be executed, and the i th process has a size of processSize[i] , where 1 ≤ i ≤ n . Also, there are m processors of different size capacity. The capacity of the j th processor is capacity[j] ( 1 ≤ j ≤ m ). A processor can process a task of size less than or equal to its capacity in 1 second, but it cannot execute processes whose size is greater than its capacity. A processor can execute multiple processes one after the other, but needs to pause for 1 second after completing its current one. Multiple processors can work on different processes simultaneously. Find the minimum time to execute all the processes or return -1 if there is no way to execute all the processes. Complete the function getMinimumTime in the editor below. getMinimumTime has the following parameters: int processSize[n] : the size of each process int capacity[m] : the capacity of each processor Returns int : the minimum time requ