2070.most beautiful items for each query

class Solution {
    public int[] maximumBeauty(int[][] items, int[] queries) {
   Arrays.sort(items,(a,b)->Integer.compare(a[0],b[0]));
   int n=items.length;
   int maxbeauty[]=new int[n];
   maxbeauty[0]=items[0][1];
   for(int i=1;i<n;i++){
    maxbeauty[i]=Math.max(maxbeauty[i-1],items[i][1]);
   }
   int result[]=new int[queries.length];
   for(int i=0;i<result.length;i++){
    int ans=0;
    int left=0;
    int right=n-1;
     while(left<=right){
     int mid=left+(right-left)/2;
     int value=items[mid][0];
     if(value<=queries[i]){
     ans=maxbeauty[mid];
     left=mid+1;
     }
     else{
        right=mid-1;
     }
    }
         result[i]=ans;
   }
     return result;
    }
}