Maximum Units

#include<bits/stdc++.h>

using namespace std;

// function to find maximum number of boxes
int maximumUnits(vector < vector < int >> & arr, int t) {
  
  // sort the array in decreasing order
  sort(arr.begin(), arr.end(), [](auto & a, auto & b) {
    return b[1] < a[1];
  });
  // variable to store the resultant boxes
  int ans = 0;
  
  // iterate the array
  for (auto & b: arr) {
    int c = min(b[0], t);
    // update the answer
    ans += c * b[1], t -= c;
    if (!t) return ans;
  }
  return ans;
}

int main() {
    // initialize the array
  vector < vector < int >> arr {{1, 3}, {2, 2}, {3,1}};
    int t = 4;
    cout << maximumUnits(arr, t);
}

8

import java.io.*;
import java.util.Arrays;

class Solution {
    
    // function to find maximum number of boxes
    public static int maximumUnits(int[][] arr, int t) {
        
        // sort the array in decreasing order
        Arrays.sort(arr, (a,b) -> b[1] - a[1]);
        
        // variable to store the resultant boxes
        int ans = 0;
        
        // iterate the array
        for (int[] b : arr) {
            int c = Math.min(b[0], t);
            
            // update the answer
            ans += c * b[1];
            t -= c;
            if (t == 0) return ans;
        }
        return ans;
    }
    public static void main (String[] args) {
        
        // initialize the array
        int[][] arr = {{1, 3}, {2, 2}, {3,1}};
        int t = 4;
        System.out.println(maximumUnits(arr, t));
    }
}

8

# function to find maximum number of c
def maximumUnits(arr, t):

    # sort the array in decreasing order
    arr.sort(key=lambda x: x[1], reverse=True)

    # variable to store the resultant c
    ans = 0

    # iterate the array
    for b,n in arr:
        c = min(b, t)
        
        # update the answer
        ans += c * n
        t -= c
        if t == 0: return ans
    return ans

# initialize the array
arr = [[1, 3], [2, 2], [3,1]]
t = 4
print(maximumUnits(arr, t))

8