CPP \\ O(nLogN) \\\
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int maxFrequencyScore(vector<int>& nums, long long k) {\n        int ans = 0 , j = 0 , n = nums.size();\n        long long cur = 0;\n        sort(nums.begin(),nums.end());\n        for(int i = 0; i < n ; i++)\n        {\n            cur+=nums[i]-nums[(i+j)/2];\n            while(cur>k){\n                cur=cur - (nums[(i+j+1)/2]-nums[j]);\n                j++;\n            }\n            ans = max(ans,i - j + 1);\n        }\n        return ans;\n    }\n};\n```
['C++']