class Solution {
public int maxFrequency(int[] nums, int k) {
int n = nums.length;//一共有多少个数
Arrays.sort(nums);//对nums进行排序
long total = 0;//滑动窗口中数之和
int ans = 1;
total = nums[0];
int left = 0;
for(int right = 1; right < n;right++){
while((right-left) * nums[right] > total+k){
total -= nums[left];
left += 1;
}
total += nums[right];
ans = Math.max(ans,right-left+1);
}
return ans;
}
}