Suma mínima del producto de elementos de pares de la array dada

Dada una array arr[] de un número par de elementos N en ella. La tarea es formar N/2 pares tales que la suma del producto de los elementos en esos pares sea mínima. 
Ejemplos 
 

Entrada: arr[] = { 1, 6, 3, 1, 7, 8 } 
Salida: 270 
Explicación: 
Los pares formados son {1, 1}, {3, 6}, {7, 8} 
Producto de la suma de estos pares = 2 * 9 * 15 = 270
Entrada: arr[] = {2, 3, 90, 12} 
Salida: 510 
Explicación: 
Los pares deben crearse de esta manera {2, 3}, {12, 90} 
Producto de la suma de estos pares = 5*112 = 510
 

Acercarse: 
 

• Ordena los elementos en la array dada arr[] .
• Haga pares de los primeros dos elementos, luego los siguientes dos elementos y así sucesivamente.
• Calcular la suma del producto de los pares correspondientes formados.

A continuación se muestra la implementación del enfoque anterior:
 

// 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 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 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# 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

<script>
// 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
   
</script>

270

Complejidad de tiempo: O(N*log N)
Espacio auxiliar : O(1)