title: Minimize Sum Product Two Arrays Permutations Allowed
signature: func minimizeSumProductTwoArraysPermutationsAllowed(a []int, b []int, n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(a []int, b []int, n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(a, b, n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{31, 85}, 
  	[]int{18, 33}, 
  	1, 558)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{22, -6, 84, 70, 84, 6, 28, -74, -14, 68, 22, 90, -10}, 
  	[]int{2, -48, -36, -4, -22, -98, -74, -92, -72, -4, 48, -32, 94}, 
  	6, -8900)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1}, 
  	[]int{0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	14, 1)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{12, 33, 93, 2, 83, 9, 61, 84, 9, 69, 2}, 
  	[]int{85, 92, 92, 1, 54, 31, 69, 4, 39, 81, 52}, 
  	7, 20524)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-92, -88, -84, -78, -78, -76, -66, -54, -52, -48, -46, -44, -40, -34, -32, -24, -20, -14, -6, -4, 2, 6, 10, 10, 22, 26, 32, 36, 36, 40, 46, 48, 56, 58, 64, 76, 80, 80, 80, 84, 84, 84, 92}, 
  	[]int{-98, -90, -82, -80, -76, -66, -62, -62, -62, -50, -50, -50, -32, -30, -14, -12, 4, 6, 12, 14, 16, 30, 30, 30, 32, 34, 40, 42, 50, 52, 56, 58, 60, 62, 62, 64, 66, 68, 78, 82, 86, 90, 94}, 
  	26, -14428)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0}, 
  	[]int{0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1}, 
  	32, 8)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{4, 6, 6, 20, 22, 23, 26, 39, 40, 47, 50, 68, 68, 70, 73, 77, 80, 82, 85}, 
  	[]int{2, 3, 15, 21, 22, 26, 35, 37, 37, 38, 57, 59, 62, 63, 64, 76, 81, 85, 91}, 
  	17, 19298)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{78, 60, -8, 46, -12}, 
  	[]int{-72, -80, -30, 16, -38}, 
  	2, -10560)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	[]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	17, 0)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{60, 66, 84, 99, 85, 89, 28, 97, 85, 71, 53, 93, 23, 9, 45, 26, 49, 95, 64, 33, 70, 34, 10, 1, 68, 39, 53, 12}, 
  	[]int{37, 33, 33, 77, 78, 34, 28, 1, 63, 15, 51, 50, 90, 22, 71, 23, 68, 55, 2, 22, 31, 54, 76, 36, 2, 27, 96, 89}, 
  	15, 44563)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def minimize_sum_product_two_arrays_permutations_allowed(A, B, n):
      sorted(A)
      sorted(B)
      result = 0
      for i in range(n):
          result += (A[i] * B[((n - i) - 1)])
      return result
source_cpp: int minimize_sum_product_two_arrays_permutations_allowed(vector<int> A, vector<int> B, int n) {
    sort(A.begin(), A.end());
    sort(B.begin(), B.end());
    int result = 0;
    for ( int i = 0;
    i < n;
    i ++ ) result += ( A [ i ] * B [ n - i - 1 ] );
    return result;
  }