Find the minimum and maximum sum of N-1 elements of the array

using System;

public class GFG{
    
    static void minMax(int[] arr)
    {
        // Initialize the min_value
        // and max_value to 0
        long min_value = 0;
        long max_value = 0;
        int n = arr.Length;
       
        // Sort array before calculating
        // min and max value
        Array.Sort(arr);
        int j = n - 1;                   
        for (int i = 0 ;i < n - 1; i++)
        {
            // All elements except
            // rightmost will be added
            min_value += arr[i];
           
            // All elements except
            // leftmost will be added
            max_value += arr[j];
            j--;
        }
        
        // Output: min_value and max_value
        Console.WriteLine(
            min_value + " "
            + max_value);
    }
 
    // Driver Code
    
    static public void Main (){
        
        
        // Initialize your array elements here
        int[] arr = { 10, 9, 8, 7, 6, 5 };
        int[] arr1 = { 100, 200, 300, 400, 500 };
        minMax(arr);
        minMax(arr1);
    }
}

// This code is contributed by rag2127

// C# program to find the minimum and maximum 
// sum from an array. 
using System;

class GFG{ 

// Function to calculate minimum and maximum sum 
static void miniMaxSum(int[] arr) 
{ 
    
    // Initialize the minElement, maxElement 
    // and sum by 0. 
    int minElement = 0, maxElement = 0, sum = 0; 

    // Assigning maxElement, minElement 
    // and sum as the first array element 
    minElement = arr[0]; 
    maxElement = minElement; 
    sum = minElement; 

    // Traverse the entire array 
    for(int i = 1; i < arr.Length; i++)
    { 
        
        // Calculate the sum of 
        // array elements 
        sum += arr[i]; 

        // Keep updating the 
        // minimum element 
        if (arr[i] < minElement) 
        { 
            minElement = arr[i]; 
        } 

        // Keep updating the 
        // maximum element 
        if (arr[i] > maxElement)
        { 
            maxElement = arr[i]; 
        } 
    } 

    // Print the minimum and maximum sum 
    Console.WriteLine((sum - maxElement) + " " +
                      (sum - minElement)); 
} 

// Driver Code 
public static void Main() 
{ 
    
    // Test Case 1: 
    int[] a1 = new int[]{ 13, 5, 11, 9, 7 }; 
    
    // Call miniMaxSum() 
    miniMaxSum(a1); 

    // Test Case 2: 
    int[] a2 = new int[]{ 13, 11, 45, 32, 89, 21 }; 
    miniMaxSum(a2); 

    // Test Case 3: 
    int[] a3 = new int[]{ 6, 3, 15, 27, 9 }; 
    miniMaxSum(a3); 
} 
}

// This code is contributed by sanjoy_62