Method maxScore

MaximizeTheMinimumGameScore.java:52–69

(int[] points, int m)

x = (midVal + points[I] - 1 )/ points[I]
*/
//code
class Solution {
    public long maxScore(int[] points, int m) {
        int n = points.length;
        if (m < n) return 0;

        long left = 1, right = (long) 1e18, maxPossibleMinScore = 0;
        
        while (left <= right) {
            long targetScore = left + (right - left) / 2;
            if (canAchieve(points, n, m, targetScore)) {
                maxPossibleMinScore = targetScore;
                left = targetScore + 1;
            } else {
                right = targetScore - 1;
            }
        }
        
        return maxPossibleMinScore;
    }