2592_MaximizeGreatnessofanArray - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int maximizeGreatness(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int n = nums.size();
        int l = 0 ,r  = nums.size()-1;
        int  i = n-1;
        while(l<=r) {
            if(nums[i] >= nums[r]) l++; // 打不過就派最小的
            else r--;
            i--;
        }
        return n-r-1;       
    }
};