# Algos.Hackerrank.Mini – Max Summ

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, . Our minimum sum is  and our maximum sum is . We would print

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  of  elements.

miniMaxSum has the following parameter(s):

• arr: an array of  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

Sample Output

Explanation

Our initial numbers are , and . We can calculate the following sums using four of the five integers:

1. If we sum everything except , our sum is .
2. If we sum everything except , our sum is .
3. If we sum everything except , our sum is .
4. If we sum everything except , our sum is .
5. If we sum everything except , our sum is .

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

MyDecision

Complexity O(n)

This entry was posted in C#. Bookmark the permalink.