1300. Sum of Mutated Array Closest to Target

Given an integer array arr and a target value target, return the integer value such that when we change all the integers larger than value in the given array to be equal to value, the sum of the array gets as close as possible (in absolute difference) to target.

In case of a tie, return the minimum such integer.

Notice that the answer is not neccesarilly a number from arr.

class Solution {
    long search(vector<int>& arr, long& m) {
        long res = 0;
        for(auto& n : arr)
            res += (n > m ? m : n);
        return res;
    }
public:
    int findBestValue(vector<int>& arr, int target) {
        long l = 0, r = *max_element(begin(arr), end(arr)), res = INT_MAX, diff = INT_MAX;
        while(l <= r) {
            long m = l + (r - l) / 2;
            long s = search(arr, m);
            if(abs(target - s) < diff) {
                res = m;
                diff = abs(target - s);
            } else if(abs(target - s) == diff and res > m) {
                res = m;
            }
            
            if(s >= target) r = m - 1;
            else l = m + 1;
        }
        return res;
    }
};