Apply Operations to Maximize Frequency Score

Given an integer array and k unit increment/decrement operations, maximize the frequency of any value by changing elements; the core challenge is to find the largest subset whose total absolute distance to a common target is ≤ k — solvable by sorting and using sliding-window/prefix-sums or median-based cost checks.