comefrom: <doocs>1874.Minimize Product Sum of Two Arrays_1.py
code: def minProductSum( nums1: List[int], nums2: List[int]) -> int:
      nums1.sort()
      nums2.sort()
      n, res = len(nums1), 0
      for i in range(n):
          res += nums1[i] * nums2[n - i - 1]
      return res
masked: def sample_funcname ( var_0 : List [ int ] , var_3 : List [ int ] ) -> int :
      var_0.sort ( )
      var_3.sort ( )
      var_6 , var_8 = len ( var_0 ) , 0
      for var_10 in range ( var_6 ) :
          var_8 += var_0 [ var_10 ] * var_3 [ var_6 - var_10 - 1 ]
      return var_8
  