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.
- Prepare
- Algorithms
- Warmup
- Mini-Max Sum
- Discussions
Mini-Max Sum
Mini-Max Sum
+ 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)
+ 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;
}
+ 0 comments lol , i did't notice hint
+ 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) }
+ 1 comment def miniMaxSum(arr): print(sum(arr)-max(arr),sum(arr)-min(arr))
Load more conversations
Sort 5342 Discussions, By:
Please Login in order to post a comment