1
class Solution {
2
 public:
3
  long long minimumRemoval(vector<int> &beans) {
4
    long long n = beans.size();
5
    sort(beans.begin(), beans.end());
6
    long long sum = 0;
7
    for (int i = 0; i < n; i++) {
8
      sum += beans[i];
9
    }
10
    long long ans = sum;
11
    for (int i = 0; i < n; i++) {
12
      long long curr = sum - (n - i) * beans[i];
13
      if (ans > curr) ans = curr;
14
    }
15
    return ans;
16
  }
17
};