拜托了！求调！

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int f(vector<int> arr, int h)
{
    long long sum = 0;
    for (int i = 0; i < arr.size(); i++)
    {
        if (arr[i] > h)
        {
            sum += arr[i] - h;
        }
    }
    return sum;
}
int findtarget(vector<int> arr, int h0)
{
    int left = 0;
    int right = arr[arr.size() - 1];
    int best_h = 0;
    while (left <= right)
    {
        int mid = (left + right) / 2;
        int current_cut = f(arr, mid);
        if (current_cut < h0)
        {
            right = mid - 1;
        }
        else if (current_cut > h0)
        {
            best_h = mid;
            left = mid + 1;
        }
        else
        {
            return mid;
        }
    }
    return best_h;
}
int main()
{
    int n;
    long m;
    cin >> n >> m;
    vector<int> arr(n);
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
    sort(arr.begin(), arr.end());
    cout << findtarget(arr, m);
    return 0;
}