Description
Solutions
Submission
Minimize Cost
🤘 INTERN

Given an integer array, reduce the array to a single element.

In each operation, pick two indices i and j (where i != j)), and:

  • append the value ofa[i] + a[j] to the array
  • delete a[i] and a[j] from the array

    • The cost of each operation is a[i] + a[j]. Find the minimum possible cost to redue the array.

    Function Description

    Complete the function minimizeCost in the editor.

    minimizeCost has the following parameter:

  • int arr[n]: an array of integers

    • Returns

  • int: the minimum cost of reducing the array

    • Example 1: 

    Input:  arr = [25, 10, 20]
    Output: 85 
    Explanation:
    

a. Pick 10 and 20, cost = 10 + 20 = 30, array' = [25, 30]

b. Pick 25 and 30, cost = 25 + 30 = 55, array'' = [55]

The cost is 30 + 55 = 85. This is the minimum possible cost.
    Constraints:
      N/A (If you know about it, feel free to contact us. TYVM!
    Testcase
    Result
    Case 1

    input:

    output: