AlgoExpert Tandem Bike

import java.util.*;

class Program {

  public int tandemBicycle(int[] redShirtSpeeds, int[] blueShirtSpeeds, boolean fastest) {
    Arrays.sort(redShirtSpeeds);
    Arrays.sort(blueShirtSpeeds);
    int sum = 0;
    for (int i = 0; i < redShirtSpeeds.length; i++){
      if (fastest){
        sum += Math.max(redShirtSpeeds[i], blueShirtSpeeds[redShirtSpeeds.length - 1 - i]);
      } else {
        sum += Math.max(redShirtSpeeds[i], blueShirtSpeeds[i]); 
      }
    }
    return sum;
  }
}