Кухня(); Задание N39.

public static int[] solve(int[] arr) {
    int sum = 0;
    int iMin = 0;
    for (int i = 0; i < arr.length; i++) {
        sum += arr[i];
        iMin = arr[i] <= arr[iMin] ? i : iMin;
    }
    arr[iMin] = sum / arr.length;
    return arr;
}