54. 2300. Successful Pairs of Spells and Potions

class Solution {
    public int[] successfulPairs(int[] spells, int[] potions, long success) {
        Arrays.sort(potions);
        int ans[]=new int[spells.length];
        for(int i=0;i<spells.length;i++){
            int low=0;
            int high=potions.length-1;
            int pos=-1;
            long mul=spells[i];
            while(low<=high){
                int mid=low+(high-low)/2;
                if(mul*potions[mid]>=success){
                    high=mid-1;
                    pos=mid;
                }else{
                    low=mid+1;
                }
            }
            if(pos!=-1){
                ans[i]=potions.length-pos;
            }
        }
        return ans;
    }
}