# Sum Of Max And Min

Last Updated: 7 Jan, 2021
Difficulty: Easy

## PROBLEM STATEMENT

#### You are given an array “ARR” of size N. Your task is to find out the sum of maximum and minimum elements in the array.

``````Can you do the above task in a minimum number of comparisons?
``````
##### Input format:
``````The first line of input contains a single integer T, representing the number of test cases.
Then the T test cases follow.

The first line of each test case contains a single integer N representing the size of the array 'ARR'.

The second line of each test case contains N space separated integers representing the elements of the array “arr”.
``````
##### Output format:
``````For each test case, print the sum of the maximum and minimum element of the array 'ARR'.
``````
##### Note:
``````You do not need to print anything. It has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 10
1 <= N <= 10^5
-10^9 <= ARR[i] <= 10^9

Time limit: 1 second
``````

## Approach 1

Sort the array so that the 0th element will be the minimum value of the array and the last element will be the maximum value present in out array.