Decrease time to finish N duties when job accomplished by every is given

Given N duties and N individuals who can work on them. Every job requires A[i] (0 <= i <= N-1) items of labor to finish and every individual can do at most B[i] items of labor per day. Assign a job to every individual in order that the overall time taken to finish all of the duties is minimized. Discover the minimal variety of days taken to finish all of the duties.

Be aware: Each individual has to do precisely one job and two or extra individuals can’t work on the identical job.

Examples:

Enter: N = 3, A = {6, 3, 6}, B = {2, 6, 8}
Output: 2
Rationalization: Assign 1st job to 2nd individual, 2nd job to 1st individual and third job to third individual.
Days taken by 1st, 2nd and third individual will probably be: 2, 1, 1 

Enter: N = 2, A = {100, 100}, B = {1, 200}
Output: 100
Rationalization: Because the work required by each duties is similar, we will assign them in any order.

Strategy: To unravel the issue observe the beneath thought:

Assign most quantity of labor to the one who can do most items of labor per day. This leads to the calculation of minimal days required to finish all of the duties. 

Observe the given steps to resolve the issue:

• Type each the arrays in reducing order
• Iterate over each the arrays concurrently to calculate the variety of days
  • If A[i] is lower than or equal to B[i], then solely in the future is required to finish this job
  • Else if A[i] % B[i] isn’t equal to zero then (A[i] / B[i]) + 1 days will probably be required
  • In any other case, A[i] / B[i] days will probably be required.
• The utmost worth from the calculated days is the required reply.

Under is the implementation for the above strategy:

Time Complexity: O(N * log N)
Auxiliary House: O(1)