human
I found an interesting problem on https://leetcode.com/problems/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.
 
Example 1:
Input: arr = [4,9,3], target = 10
Output: 3
Explanation: When using 3 arr converts to [3, 3, 3] which sums 9 and that's the optimal answer.

Example 2:
Input: arr = [2,3,5], target = 10
Output: 5

Example 3:
Input: arr = [60864,25176,27249,21296,20204], target = 56803
Output: 11361

 
Constraints:

1 <= arr.length <= 10^4
1 <= arr[i], target <= 10^5

I tried it in Python, but could not do it. Can you solve it?

=====
What is a the Python code you requested?
assistant
#Here is the Python code you requested.

class Solution:
    def findBestValue(self, arr: List[int], target: int) -> int:
        def calculate(value):
            s = 0
            for x in arr:
                s += min(x, value)
            
            return s
        
        l, r = 1, max(arr)
        while l <= r:
            mid = l + (r - l) // 2
            if calculate(mid) < target:
                l = mid + 1
            else:
                r = mid - 1
        
        if abs(calculate(l - 1) - target) <= abs(calculate(l) - target):
            return l - 1
        
        return l