add 1874

fishercoder1534 · fishercoder1534 · commit 91f3cff5aed5 · 2021-10-17T10:09:36.000-07:00
diff --git a/README.md b/README.md
@@ -67,6 +67,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1880|[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java) ||Easy|String|
 |1877|[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java) ||Medium|Greedy, Sort|
 |1876|[Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1876.java) ||Easy|String|
+|1874|[Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1874.java) ||Medium|Array, Greedy, Sorting|
 |1869|[Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1869.java) ||Easy|Array, Two Pointers|
 |1863|[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java) ||Easy|Backtracking, Recursion|
 |1862|[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java) ||Hard|Math|
diff --git a/src/main/java/com/fishercoder/solutions/_1874.java b/src/main/java/com/fishercoder/solutions/_1874.java
@@ -0,0 +1,17 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1874 {
+    public static class Solution1 {
+        public int minProductSum(int[] nums1, int[] nums2) {
+            Arrays.sort(nums1);
+            Arrays.sort(nums2);
+            int ans = 0;
+            for (int i = 0, j = nums1.length - 1; i < nums1.length && j >= 0; i++, j--) {
+                ans += nums1[i] * nums2[j];
+            }
+            return ans;
+        }
+    }
+}
