2968. Apply Operations to Maximize Frequency Score

You are given a 0-indexed integer array nums and an integer k.

You can perform the following operation on the array at most k times:

• Choose any index i from the array and increase or decrease nums[i] by 1.

The score of the final array is the frequency of the most frequent element in the array.

Return the maximum score you can achieve.

The frequency of an element is the number of occurences of that element in the array.

class Solution {
public:
    int maxFrequencyScore(vector<int>& A, long long k) {
        int i = 0, n = A.size();
        sort(A.begin(), A.end());
        for (int j = 0; j < n; ++j) {
            if ((k -= A[j] - A[(i + j) / 2]) < 0)
                k += A[(i + j + 1) / 2] - A[i++];
        }

        return n - i;
    }
};