LeetCode2389. Longest Subsequence With Limited Sum

class Solution {
    public int[] answerQueries(int[] nums, int[] queries) {
        int[] res = new int[queries.length];

        Arrays.sort(nums);
        for(int i = 1; i < nums.length; i++){
            nums[i] += nums[i-1];
        }
        
        for(int i = 0; i < queries.length; i++){
            int q = queries[i];
            int len = binarySearch(nums, q);
            res[i] = len;
        }
        return res;
    }

    public int binarySearch(int[] nums, int q){
        int len = 0;
        int low = 0, high = nums.length-1;
        while(low <= high){
            int mid = low + (high-low)/2;
            if(nums[mid] <= q){
                len = Math.max(len,mid+1);
                low = mid+1;
            }
            else    high = mid-1;
        }
        return len;
    }
}