# Minimize the sum calculated by repeatedly removing any two elements and inserting their sum to the Array

Given **N** elements, you can remove any two elements from the list, note their sum and add the sum to the list. Repeat these steps while there are more than a single element in the list. The task is to minimize the sum of these chosen sum in the end.

**Examples:**

Input:arr[] = {1, 4, 7, 10}

Output:39

Choose 1 and 4, Sum = 5, arr[] = {5, 7, 10}

Choose 5 and 7, Sum = 17, arr[] = {12, 10}

Choose 12 and 10,Sum = 39, arr[] = {22}

Input:arr[] = {1, 3, 7, 5, 6}

Output:48

**Approach:** In order to minimize the sum, the elements that gets chosen at every step must the minimum elements from the list. In order to do that efficiently, a priority queue can be used. At every step, while there are more than a single element in the list, choose the minimum and the second minimum, remove them from the list add their sum to the list after updating the running sum.

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 ` `int` `getMinSum(` `int` `arr[], ` `int` `n) ` `{ ` ` ` `int` `i, sum = 0; ` ` ` ` ` `// Priority queue to store the elements of the array ` ` ` `// and retrieve the minimum element efficiently ` ` ` `priority_queue<` `int` `, vector<` `int` `>, greater<` `int` `> > pq; ` ` ` ` ` `// Add all the elements ` ` ` `// to the priority queue ` ` ` `for` `(i = 0; i < n; i++) ` ` ` `pq.push(arr[i]); ` ` ` ` ` `// While there are more than 1 elements ` ` ` `// left in the queue ` ` ` `while` `(pq.size() > 1) ` ` ` `{ ` ` ` ` ` `// Remove and get the minimum ` ` ` `// element from the queue ` ` ` `int` `min = pq.top(); ` ` ` ` ` `pq.pop(); ` ` ` ` ` `// Remove and get the second minimum ` ` ` `// element (currently minimum) ` ` ` `int` `secondMin = pq.top(); ` ` ` ` ` `pq.pop(); ` ` ` ` ` `// Update the sum ` ` ` `sum += (min + secondMin); ` ` ` ` ` `// Add the sum of the minimum ` ` ` `// elements to the queue ` ` ` `pq.push(min + secondMin); ` ` ` `} ` ` ` ` ` `// Return the minimized sum ` ` ` `return` `sum; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` ` ` `int` `arr[] = { 1, 3, 7, 5, 6 }; ` ` ` `int` `n = ` `sizeof` `(arr)/` `sizeof` `(arr[0]); ` ` ` `cout << (getMinSum(arr, n)); ` `} ` ` ` `// This code is contributed by mohit ` |

*chevron_right*

*filter_none*

## Java

`// Java implementation of the approach ` `import` `java.util.PriorityQueue; ` ` ` `class` `GFG ` `{ ` ` ` ` ` `// Function to return the minimized sum ` ` ` `static` `int` `getMinSum(` `int` `arr[], ` `int` `n) ` ` ` `{ ` ` ` `int` `i, sum = ` `0` `; ` ` ` ` ` `// Priority queue to store the elements of the array ` ` ` `// and retrieve the minimum element efficiently ` ` ` `PriorityQueue<Integer> pq = ` `new` `PriorityQueue<>(); ` ` ` ` ` `// Add all the elements ` ` ` `// to the prioriry queue ` ` ` `for` `(i = ` `0` `; i < n; i++) ` ` ` `pq.add(arr[i]); ` ` ` ` ` `// While there are more than 1 elements ` ` ` `// left in the queue ` ` ` `while` `(pq.size() > ` `1` `) ` ` ` `{ ` ` ` ` ` `// Remove and get the minimum ` ` ` `// element from the queue ` ` ` `int` `min = pq.poll(); ` ` ` ` ` `// Remove and get the second minimum ` ` ` `// element (currently minimum) ` ` ` `int` `secondMin = pq.poll(); ` ` ` ` ` `// Update the sum ` ` ` `sum += (min + secondMin); ` ` ` ` ` `// Add the sum of the minimum ` ` ` `// elements to the queue ` ` ` `pq.add(min + secondMin); ` ` ` `} ` ` ` ` ` `// Return the minimized sum ` ` ` `return` `sum; ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `main(String[] args) ` ` ` `{ ` ` ` `int` `arr[] = { ` `1` `, ` `3` `, ` `7` `, ` `5` `, ` `6` `}; ` ` ` `int` `n = arr.length; ` ` ` `System.out.print(getMinSum(arr, n)); ` ` ` `} ` `} ` |

*chevron_right*

*filter_none*

**Output:**

48

## Recommended Posts:

- Average of remaining elements after removing K largest and K smallest elements from array
- Minimize the sum of the squares of the sum of elements of each group the array is divided into
- Rearrange an array to minimize sum of product of consecutive pair elements
- Maximum distinct elements after removing k elements
- Minimize sum by dividing all elements of a subarray by K
- Minimize the sum after choosing elements from the given three arrays
- Minimize the difference between minimum and maximum elements
- Make two sets disjoint by removing minimum elements
- Minimize the sum of the array according the given condition
- Remove an element to minimize the LCM of the given array
- Minimize the cost of partitioning an array into K groups
- Minimize sum of adjacent difference with removal of one element from array
- Minimize the number of steps required to reach the end of the array | Set 2
- Minimize the number of steps required to reach the end of the array
- Minimize the maximum minimum difference after one removal from array

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.