The product sum of two integer arrays nums1 and nums2 of equal length n is defined as the sum of nums1[i] $ imes$ nums2[i] for all $0 \leq$ i $<$ n.

Given two integer arrays nums1 and nums2 of length n, return the minimum product sum achievable after permuting the elements of nums1.

Constraints:

• n $==$ nums1.length $==$ nums2.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ nums1[i], nums2[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.