public static void miniMaxSum(List<Integer> arr) {
        long max = 0;
        long min = 0;
        
        for(int i = 0; i < arr.size(); i++) {
            long count = 0;
            
            for (int j = 0; j < arr.size(); j++) {
                if (j != i) {
                    count += arr.get(j);
                }
            }
            
            if (count > max || max == 0) max = count;
            if (count < min || min == 0) min = count;
        }
        
        System.out.printf("%d %d", min, max);
    }

public static void miniMaxSum(List<int> arr)
    {
            long sumTotal = arr.Sum();
            long maxE = arr.Max();
            long minE = arr.Min();
            long min = sumTotal - maxE;
            long max = sumTotal - minE;
            Console.WriteLine($"{min}  {max}");
    }

const { sum, min, max } = arr.reduce((acc, curr) => {
        acc.sum += curr;
        acc.min = curr < acc.min ? curr : acc.min;
        acc.max = curr > acc.max ? curr : acc.max;
        return acc;
    },
    {
        sum: 0,
        min: Infinity,
        max: -Infinity,
    })
    console.log(sum - max, sum - min)

function miniMaxSum(arr) {
    let sum=0,min=arr[0],max=arr[0];
    for(let i=0; i<arr.length; i++){
        sum = sum + arr[i];
        if(arr[i]<min){
            min=arr[i];
        }
        if(arr[i]>max){
            max=arr[i];
        }
    }
    console.log(sum-max,sum-min)
}