Given an array consisting of **even** number of elements, the task is to divide the array into **M** group of elements (every group must contain at least 2 elements) such that the sum of the squares of the sums of each group is minimized i.e.,

(sum_of_elements_of_group1)^{2} + (sum_of_elements_of_group2)^{2} + (sum_of_elements_of_group3)^{2} + (sum_of_elements_of_group4)^{2} + ….. + (sum_of_elements_of_groupM)^{2}

**Examples:**

Input:arr[] = {5, 8, 13, 45, 6, 3}

Output:2824

Groups can be (3, 45), (5, 13) and (6, 8)

(3 + 45)^{2}+ (5 + 13)^{2}+ (6 + 8)^{2}= 48^{2}+ 18^{2}+ 14^{2}= 2304 + 324 + 196 = 2824

Input:arr[] = {53, 28, 143, 5}

Output:28465

**Approach:** Our final sum depends on two factors:

- Sum of the elements of each group.
- The sum of squares of all such groups.

If we minimize both the factors mentioned above, we can minimize the result. To minimize the second factor we should make groups of minimum size i.e. just two elements. To minimize first factor we can pair smallest number with largest number, second smallest number to second largest number and so on.

Below is the implementation of the above approach:

## C++

`// C++ implementation of the approach ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to return the minimized sum ` `unsigned ` `long` `long` `findAnswer(` `int` `n, ` ` ` `vector<` `int` `>& arr) ` `{ ` ` ` ` ` `// Sort the array to pair the elements ` ` ` `sort(arr.begin(), arr.end()); ` ` ` ` ` `// Variable to hold the answer ` ` ` `unsigned ` `long` `long` `sum = 0; ` ` ` ` ` `// Pair smallest with largest, second ` ` ` `// smallest with second largest, and ` ` ` `// so on ` ` ` `for` `(` `int` `i = 0; i < n / 2; ++i) { ` ` ` `sum += (arr[i] + arr[n - i - 1]) ` ` ` `* (arr[i] + arr[n - i - 1]); ` ` ` `} ` ` ` ` ` `return` `sum; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `std::vector<` `int` `> arr = { 53, 28, 143, 5 }; ` ` ` `int` `n = arr.size(); ` ` ` `cout << findAnswer(n, arr); ` `} ` |

*chevron_right*

*filter_none*

## Python3

# Python 3 implementation of the approach

# Function to return the minimized sum

def findAnswer(n, arr):

# Sort the array to pair the elements

arr.sort(reverse = False)

# Variable to hold the answer

sum = 0

# Pair smallest with largest, second

# smallest with second largest, and

# so on

for i in range(int(n / 2)):

sum += ((arr[i] + arr[n – i – 1]) *

(arr[i] + arr[n – i – 1]))

return sum

# Driver code

if __name__ == ‘__main__’:

arr = [53, 28, 143, 5]

n = len(arr)

print(findAnswer(n, arr))

# This code is contributed by

# Surendra_Gangwar

**Output:**

28465

## Recommended Posts:

- Maximum difference between group of k-elements and rest of the array.
- Rearrange an array to minimize sum of product of consecutive pair elements
- Minimize the sum of squares of sum of N/2 paired formed by N numbers
- Largest sub-array whose all elements are perfect squares
- Sort array after converting elements to their squares
- Minimize the difference between minimum and maximum elements
- Ways of dividing a group into two halves such that two elements are in different groups
- Find if array can be divided into two subarrays of equal sum
- Check if an array can be divided into pairs whose sum is divisible by k
- Find reminder of array multiplication divided by n
- Check if an array of 1s and 2s can be divided into 2 parts with equal sum
- Check if a sorted array can be divided in pairs whose sum is k
- Check if array can be divided into two sub-arrays such that their absolute difference is K
- Find the sums for which an array can be divided into sub-arrays of equal sum
- Possible number of Rectangle and Squares with the given set of elements