class Solution {
    public int maxFrequency(int[] nums, int k) {
        Arrays.sort(nums);
        int len = nums.length;
        int left = 0, right = 1;        // 确定初始值
        int ans = 1;                    //最小答案也可以为1
        while(right < len){
            k -= (nums[right] - nums[right - 1]) * (right - left);
            if(k >= 0)
            //k>=0代表可以补足，符题意
                ans = right - left + 1;
            else{
                //不符合题意的答案，left要相应右移一位
                k += nums[right] - nums[left];
                left++;
            }
            right++;
        }
        return ans;
    }
}