100% || C++
IntuitionThe approach is same as : https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i/solutions/6516235/100-c-by-giri_6
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

The approach is same as : https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i/solutions/6516235/100-c-by-giri_69-zri7/

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int maxFrequency(vector<int>& nums, int k, int numOperations) {
        unordered_map<int, int> points_cover;
        unordered_map<int, int> cnt_points;
        set<int> points;

        for (int num : nums) {
            cnt_points[num]++;
            points_cover[num - k]++;
            points_cover[num + k + 1]--;
            points.insert(num);
            points.insert(num - k);
            points.insert(num + k + 1);
        }

        int res = 0;
        int points_cover_this_point = 0;

        for (int point : points) {
            points_cover_this_point += points_cover[point];
            int Additional= min(points_cover_this_point - cnt_points[point], numOperations);
            res = max(res, cnt_points[point] + Additional); 
        }

        return res;
    }
};
```
['C++']