LEFTOVER

Given an array of integers A of size N and an integer B.

Some value can be transferred from one element to the other. Every time x is transferred (x is not necessarily an integer) B percent of it is lost.
That is, if x was transferred from one element to the other, value of first one decreased by x units and in other increased by x -
(x * B)/100.

Your task is to make all elements of A equal by these transfers.Find what can be the maximum integral value of each element after the transfers.

Note: If maximum possible value is 2.6 return its integral part i.e. 2.

The first argument given is the integer array A.
The second argument given is the integer B.

Find and return what can be the maximum integral value of each element after the transfers.

1 <= N <= 10000
0 <= A[i] <= 1000
0 <= B <= 99

Input 1:
    A = [4, 2, 1]
    B = 50
Output 1:
    2
Explanation:
    Transfer x = 2 from A[1] to A[3] 

Input 2:
    A = [1, 11]
    B = 90
Output 2:
    1

Solution:

Time:O(n)

public class Solution {
    public int solve(int[] A, int B) {
        double p = (double) B;
        int left = 0;
        int right = 1000;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            int[] counted = count(A, mid);
            int additional = (int) (counted[0] * (100 - p) / 100);
            int needed = (int) (counted[1]);
            if (additional == needed) {
                return mid;
            } else if (additional > needed) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return right;
    }
    
    private int[] count(int[] A, int avg) {
        int a = 0;
        int n = 0;
        for (int val : A) {
            if (val > avg) {
                a += val - avg;
            } else if (val < avg){
                n += avg - val;
            }
        }
        return new int[]{a, n};
    }
}