2022.11.15-----leetcode.1710

 public int maximumUnits(int[][] boxTypes, int truckSize) {
        Arrays.sort(boxTypes,(a,b)->b[1]-a[1]);
        int n=boxTypes.length;
        int ans=0;
        for(int i=0;i<n&&truckSize>0;i++){
            if(truckSize>=boxTypes[i][0]){
                truckSize-=boxTypes[i][0];
                ans+=boxTypes[i][0]*boxTypes[i][1];
            }else{
                 ans+=boxTypes[i][1]*truckSize;
                truckSize=0;
               
            }

        }
        return ans;
    }