Sum of Maximum and Minimum Elements Problem Statement

Given an array ARR of size N, your objective is to determine the sum of the largest and smallest elements within the array.

Follow Up:

Can you achieve the above task using the least number of comparisons possible?

Input:

The first line contains an integer T, the number of test cases.
For each test case, the first line contains an integer N, representing the size of the array ARR.
The second line contains N space-separated integers, which are the elements of array ARR.

Output:

For each test case, output the sum of the maximum and minimum elements in the array ARR.

Example:

Input:

2
5
1 3 5 7 9
4
-10 4 7 19

Output:

10
9

Explanation:

In the first test case, the maximum is 9 and the minimum is 1. Their sum is 10.
In the second test case, the maximum is 19 and the minimum is -10. Their sum is 9.

Constraints:

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 10^5
• -10^9 ≤ ARR[i] ≤ 10^9

Note:

You are not required to print anything; the function should handle processing the results.