Leaderboard
Showing:
Minimize sum of alternate product
Basic Accuracy: 59.98% Submissions: 450 Points: 1

Given an array of even size consisting of positive integers. Your task is to find the sum after sorting the array, such that the sum of product of alternate elements is minimum.

 

Example 1:

Input:
8
9 2 8 4 5 7 6 0
Output:
74
Explanation:
Required sum can be obtained as
9*0 + 8*2 + 7*4 + 6*5 which
is equal to 74.

 

Example 2:

Input:
4
1 2 3 4
Output:
10
Explanation:
1*4 + 2*3 = 10

 

Your Task:  
You don't need to read input or print anything. Your task is to complete the function altPoduct() which takes the array A[] and its size N as inputs and returns the minimum sum.


Expected Time Complexity: O(N. log(N))
Expected Auxiliary Space: O(1)

 

Constraints:
2 ≤ N ≤ 105
1 ≤ Ai ≤ 107
N is always even

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Minimize sum of alternate product

Output Window