Hackerrank - Mini-Max Sum Solution

# Hackerrank - Mini-Max Sum Solution Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers.

For example, arr= [1,3,5,7,9] . Our minimum sum is 1+3+5+7=16 and our maximum sum is 3+5+7+9=24. We would print

16 24


Function Description

Complete the miniMaxSum function in the editor below. It should print two space-separated integers on one line: the minimum sum and the maximum sum of 4 of 5 elements.

miniMaxSum has the following parameter(s):

• arr: an array of 5 integers

Input Format

A single line of five space-separated integers.

Constraints

Output Format

Print two space-separated long integers denoting the respective minimum and maximum values that can be calculated by summing exactly four of the five integers. (The output can be greater than a 32 bit integer.)

Sample Input

1 2 3 4 5


Sample Output

10 14


Explanation

Our initial numbers are 1, 2, 3, 4, and 5. We can calculate the following sums using four of the five integers:

1. If we sum everything except 2+3+4+5, our sum is 14.
2. If we sum everything except 1+3+4+5, our sum is 13.
3. If we sum everything except 1+2+4+5, our sum is 12.
4. If we sum everything except 1+2+3+5, our sum is 11.
5. If we sum everything except 1+2+3+4, our sum is 10.

Hints: Beware of integer overflow! Use 64-bit Integer.

Need help to get started? Try the Solve Me First problem

### Solution in Python

def miniMaxSum(arr):
arr.sort()
print(sum(arr[:4]), sum(arr[1:]))

arr = list(map(int, input().split()))
miniMaxSum(arr)