We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Warmup
  4. Mini-Max Sum
  5. Discussions

Mini-Max Sum

Sort 5342 Discussions, By:

  • lucasopoka
     + 0 comments

    My Python solution:

    def miniMaxSum(arr):
    arr.sort()
    print(sum(arr[:-1]), sum(arr[1:]))

arr = list(map(int, input().rstrip().split()))
miniMaxSum(arr)

  • sharp_thinker
     + 0 comments

    soloution in C++

    int main (){

    int n = 5;
long long sum = 0;
int element[n];
for (int i = 0; i < n; i++){
    cin >> element[i];
    sum += element[i];
}
sort(element, element + n);
cout << sum - element[n - 1] << " " << sum - element[0];




return 0;

    }

  • nguyenbaxuanan_1
     + 0 comments

    lol , i did't notice hint

  • norbertosantiag1
     + 0 comments

    Javascript solution: 

    function miniMaxSum(arr) {
    // Write your code here
    arr.sort((a, b) => a - b)
    let minSum = 0
    let maxSum = 0
    
    for(let i = 0; i < arr.length; i++) {
        if(i < arr.length - 1) minSum += arr[i]
        
        if(i > 0) maxSum += arr[i]
    }
    
    console.log(minSum, maxSum)
}

  • OsamaAlaa
     + 1 comment
    def miniMaxSum(arr):
    
    print(sum(arr)-max(arr),sum(arr)-min(arr))
Load more conversations