2171. 拿出最少数目的魔法豆

 2171. 拿出最少数目的魔法豆 - 力扣（LeetCode）

class Solution {
public:
    long long minimumRemoval(vector<int>& b) {
       int n = b.size();
       long long ans =  LONG_LONG_MAX;
       sort(b.begin(), b.end());
       vector<long long> sum(n + 1);
       for (int i = 0; i < n; i++) sum[i + 1] = b[i] + sum[i];
       for (int i = 0; i < n; i++) {
           ans = min(ans, sum[n] - (n - i) * 1LL * b[i]);
       } 
       return ans;
    }
};