Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6564 |

@blackshadows | 6400 |

@mb1973 | 5785 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4639 |

@sanjay05 | 3762 |

@mantu_singh | 3712 |

@gfgaccount | 3627 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@yaswanthero123 | 625 |

@vikash619 | 611 |

@venkat11803610 | 501 |

@roshan13ar | 396 |

@DevangSingh | 379 |

@ravi11815721 | 312 |

@hrishipangavhane | 286 |

@aryanjain85297 | 280 |

@kommaraju11806903 | 277 |

@infosumitraut | 272 |

@sanalbabunb | 263 |

Complete Leaderboard |

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 ≤ 10^{5}

1 ≤ A_{i} ≤ 10^{7}

N is always even

Login to report an issue on this page.

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

YesLoading...

Minimize sum of alternate product

...