给定数组的元素对的最小乘积总和

给定一个数组arr[] ，其中包含偶数个元素N。任务是形成 N/2 对，使得这些对中元素的乘积之和最小。
例子

Input: arr[] = { 1, 6, 3, 1, 7, 8 } 
Output: 270 
Explanation: 
The pair formed are {1, 1}, {3, 6}, {7, 8} 
Product of sum of these pairs = 2 * 9 * 15 = 270
Input: arr[] = {2, 3, 90, 12} 
Output: 510 
Explanation: 
Pairs should be created in this way {2, 3}, {12, 90} 
Product of sum of these pairs = 5*112 = 510
 

方法：

• 对给定数组arr[] 中的元素进行排序。
• 使前两个元素成对，然后是下一个两个元素，依此类推。
• 计算形成的对应对的乘积之和。

下面是上述方法的实现：

CPP

// C++ program to find the minimum
// product of sum of pair of element
// in array arr[]
#include "bits/stdc++.h"
using namespace std;
 
// Function to find the minimum
// product
int minimumProduct(int* arr, int n)
{
 
    // Sort the array using STL
    // sort() function
    sort(arr, arr + n);
 
    // Initialise product to 1
    int product = 1;
 
    for (int i = 0; i < n; i += 2) {
 
        // Find product of sum of
        // all pairs
        product *= (arr[i] + arr[i + 1]);
    }
 
    // Return the product
    return product;
}
 
// Driver code
int main()
{
    int arr[] = { 1, 6, 3, 1, 7, 8 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    // Function call to find product
    cout << minimumProduct(arr, n) << endl;
    return 0;
}

Java

// Java program to find the minimum
// product of sum of pair of element
// in array arr[]
import java.util.*;
 
class GFG{
  
// Function to find the minimum
// product
static int minimumProduct(int[] arr, int n)
{
  
    // Sort the array using STL
    // sort() function
    Arrays.sort(arr);
  
    // Initialise product to 1
    int product = 1;
  
    for (int i = 0; i < n; i += 2) {
  
        // Find product of sum of
        // all pairs
        product *= (arr[i] + arr[i + 1]);
    }
  
    // Return the product
    return product;
}
  
// Driver code
public static void main(String[] args)
{
    int arr[] = { 1, 6, 3, 1, 7, 8 };
    int n = arr.length;
  
    // Function call to find product
    System.out.print(minimumProduct(arr, n) +"\n");
}
}
 
// This code is contributed by sapnasingh4991

Python3

# Python3 program to find the minimum
# product of sum of pair of element
# in array arr[]
 
# Function to find the minimum
# product
def minimumProduct(arr, n):
 
    # Sort the array using STL
    # sort() function
    arr = sorted(arr)
 
    # Initialise product to 1
    product = 1
 
    for i in range(0, n, 2):
 
        # Find product of sum of
        # all pairs
        product *= (arr[i] + arr[i + 1])
 
    # Return the product
    return product
 
# Driver code
 
arr = [1, 6, 3, 1, 7, 8]
n = len(arr)
 
# Function call to find product
print(minimumProduct(arr, n))
 
# This code is contributed by mohit kumar 29

C#

// C# program to find the minimum
// product of sum of pair of element
// in array arr[]
using System;
 
class GFG {
 
    // Function to find the minimum
    // product
    static int minimumProduct(int[] arr, int n)
    {
     
        // Sort the array
        // sort() function
        Array.Sort(arr);
     
        // Initialise product to 1
        int product = 1;
     
        for (int i = 0; i < n; i += 2) {
     
            // Find product of sum of
            // all pairs
            product *= (arr[i] + arr[i + 1]);
        }
     
        // Return the product
        return product;
    }
     
    // Driver code
    static void Main()
    {
        int[] arr = new int[] { 1, 6, 3, 1, 7, 8 };
        int n = arr.Length;
     
        // Function call to find product
        Console.Write(minimumProduct(arr, n));
    }
}
 
// This code is contributed by shubhamsingh10

Javascript

// Javascript program to find the minimum
// product of sum of pair of element
// in array arr[]
 
// Function to find the minimum
// product
function minimumProduct(arr, n)
{
 
    // Sort the array using STL
    // sort() function
    arr.sort();
 
    // Initialise product to 1
    let product = 1;
 
    for (let i = 0; i < n; i += 2) {
 
        // Find product of sum of
        // all pairs
        product *= (arr[i] + arr[i + 1]);
    }
 
    // Return the product
    return product;
}
 
// Driver code
    let arr = [ 1, 6, 3, 1, 7, 8 ];
    let n = arr.length;
 
    // Function call to find product
    document.write(minimumProduct(arr, n) + "<br>");
     
// This code is contributed by Mayank Tyagi
   

输出：

270

时间复杂度： O(N*log N)
辅助空间：O(1)

如果您希望与专家一起参加现场课程，请参阅DSA 现场工作专业课程和学生竞争性编程现场课程。