Company: Dell
Difficulty: medium
Parallel Job Processing There are n jobs that can be executed in parallel on a processor, where the execution time of the i th job is executionTime[i] . To speed up execution, the following strategy is used. In one operation, a job is chosen, the major job , and is executed for x seconds. All other jobs are executed for y seconds where y . A job is complete when it has been executed for at least executionTime[i] seconds, then it exits the pool. Find the minimum number of operations in which the processor can completely execute all the jobs if run optimally. Function Description Complete the function getMinimumOperations with the following parameters: int executionTime[n] : the execution times of each job int x : the time for which the major job is executed int y : the time for which all other jobs are executed Returns int : the minimum number of operations in which the processor can complete the jobs Constraints 1 ≤ n ≤ 10 5 1 ≤ executionTime[i] ≤ 10 9 1 ≤ y 9 Example Consider n = 5, e