Problem Brief

Two-Core Process Assignment

INTERNOA

You are given an array time representing the time each process takes. Distribute processes across 2 cores such that the maximum total time on any core is minimized. Return the total time for both cores as an array: [sum_core1, sum_core2].

1Example 1

Input

time = [10, 21, 10, 21, 10]

Output

[41, 31]

Explanation

o~o

Draft autosaves locally

public int[] distributeProcesses(int[] time) {
  // write your code here
}

Input

time

[10, 21, 10, 21, 10]

Output

[41, 31]