Minimize Product Sum of Two Arrays

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

from typing import List

class Solution:
    def minProductSum(self, nums1: List[int], nums2: List[int]) -> int:
        nums1.sort()
        nums2.sort(reverse=True)
        product_sum = 0
        for i in range(len(nums1)):
            product_sum += nums1[i] * nums2[i]
        return product_sum