1
class Solution {
2
  public long minimumRemoval(int[] beans) {
3
    Arrays.parallelSort(beans);
4
    long sum = 0, min = Long.MAX_VALUE;
5
    int n = beans.length;
6
    for (int i : beans) sum += i;
7
    for (int i = 0; i < n; i++) {
8
      long temp = sum - ((n - i + 0L) * beans[i]);
9
      min = (long) Math.min(min, temp);
10
    }
11
    return min;
12
  }
13
}