# HackerRank Çözümleri – Mini-Max Sum

HackerRank içerisinde bulunan “Mini-Max Sum” sorusunun açıklaması ve çözümü. Verilen 5 adet sayıdan, 4 sayının toplamının alabileceği en küçük ve en büyük değerleri bulmanız isteniyor.

► HackerRank – Mini-Max Sum: https://www.hackerrank.com/challenges/mini-max-sum/problem

► Problem açıklaması:

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.

Example:

arr = [1, 3, 5, 7, 9]

The minimum sum is 1 + 3 + 5 + 7 = 16 and the maximum sum is 3 + 5 + 7 + 9 = 24. The function prints: 16 24.

Function Description

Complete the miniMaxSum function in the editor below.

miniMaxSum has the following parameter(s):

arr: an array of 5 integers.

Print

Print two space-separated integers on one line: the minimum sum and the maximum sum of 4 of 5 elements.

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