1
/**
2
 * @param {number[]} beans
3
 * @return {number}
4
 */
5
// time complexity -> O(NlogN) and Space is O(logN) due to sorting.
6
var minimumRemoval = function (beans) {
7
  beans.sort((a, b) => a - b);
8
  let frontSum = beans.reduce((sum, a) => sum + a, 0);
9
  let backSum = 0;
10
  let done = 0;
11
  let result = Number.MAX_SAFE_INTEGER;
12
  for (let j = beans.length - 1; j >= 0; j--) {
13
    frontSum -= beans[j];
14
    count = frontSum + (backSum - beans[j] * done);
15
    result = Math.min(result, count);
16
    done++;
17
    backSum += beans[j];
18
  }
19
  return result;
20
};