#1874
Medium Algorithms Minimize product sum of two arrays
Array Greedy Sorting
89.9% acceptance
Mar 31, 2026
257
28
No description available.
Solution
Rust
Time O(n log n)
Space O(1)
impl Solution {
pub fn min_product_sum(mut nums1: Vec<i32>, mut nums2: Vec<i32>) -> i32 {
nums1.sort();
nums2.sort();
let n = nums1.len();
let mut sum = 0;
for i in 0..n {
sum += nums1[i] * nums2[n - 1 - i];
}
sum
}
}