Python solution: maxSum =sum(arr) - arr[0] minSum =sum(arr) - arr[0]

for index in range(0,len(arr)):
    currentSum = sum(arr) - arr[index]
    if(currentSum > maxSum):
        maxSum = currentSum
    if(currentSum<minSum):
        minSum = currentSum

print(minSum,maxSum)

In Golang:

func miniMaxSum(arr []int32) {
    sort.SliceStable(arr, func(i, j int) bool { return arr[i]<arr[j]})
    var sum int64 = 0 
    for i := range arr{
        sum += int64(arr[i])
    }
    fmt.Println(sum-int64(arr[len(arr)-1]), sum-int64(arr[0]))
}

Java: Collections.sort(arr); long min=0; long max=0; for(int i=0;i<4;i++){ min+=arr.get(i); } for(int j=4;j>=1;j--){ max+=arr.get(j); } System.out.println(min+" "+ max);

C#

    long totalSum = arr.Sum(x => (long)x);

    int min = arr.Min();
    int max = arr.Max();

    long minResult = totalSum - max;
    long maxResult = totalSum - min;

    Console.WriteLine($"{minResult} {maxResult}");

Kotlin Solution:

fun miniMaxSum(arr: Array<Int>) {
    val longArr = arr.map { it.toLong() }
    val totalSum = longArr.sum()
    val minSum = totalSum - longArr.maxOrNull()!!
    val maxSum = totalSum - longArr.minOrNull()!!
    println("$minSum $maxSum")
}