Minimize the single most


  • 0
    L

    Suppose there are N number of clusters, B number of machines and number of tasks in clusters are stored in an array named a. The goal is to minimize the single most overloaded machine and every cluster must be given at least one machine. Output should be one integer representing the number of the tasks in the busiest machine (rounded up).

    1<=N<=500000
    N<=B<=2000000
    1<=ai<=5000000

    for example, N=2,B=7, a=[200,450], output should be 100.

    Any ideas?

    Thanks, L


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.