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. Mini-Max Sum
  2. Discussions

Mini-Max Sum

Sort by

recency

|

389 Discussions

|

  • fazepavan
     + 0 comments
    def miniMaxSum(arr):
    # Write your code here
    total_sum = sum(arr)
    
    min_sum = total_sum - max(arr)
    max_sum = total_sum - min(arr)
    
    print(min_sum, max_sum)

  • akankshashetty11
     + 0 comments

    JAVA CODE Collections.sort(arr); long minSum = 0, maxSum = 0;

        for (int i = 0; i < 4; i++) {
        minSum += arr.get(i);
    }

    for (int i = 1; i < 5; i++) {
        maxSum += arr.get(i);
    }

    System.out.println(minSum + " " + maxSum);
}

    }

  • trupti29
     + 0 comments

    def miniMaxSum(arr): arr.sort() min1 = sum(arr[:4]) max1 = sum(arr[1:]) print(min1,max1)

  • aavotorg
     + 0 comments

    include

    include

    include // For std::sort

    void miniMaxSum(const std::vector& arr) { // Sort the array std::vector nums = arr; std::sort(nums.begin(), nums.end());

    // Calculate the minimum and maximum sums
long minSum = 0, maxSum = 0;
for (int i = 0; i < 4; i++) {
    minSum += nums[i];          // Sum of the smallest 4 elements
    maxSum += nums[i + 1];      // Sum of the largest 4 elements
}

std::cout << minSum << " " << maxSum << std::endl;

    }

    int main() { std::vector arr(5); for (int i = 0; i < 5; ++i) { std::cin >> arr[i]; }

    miniMaxSum(arr);

return 0;

    }

  • juandadky2020
     + 0 comments

    Kotlin Solution

    fun miniMaxSum(arr: Array<Int>): Unit {
    val sum = arr.sumOf { it.toLong() }
    arr.sort()
    val maxSum = sum - arr.first()
    val minSum = sum - arr.last()
    print("$minSum $maxSum")
}