4/02/2017

Mini-Max Sum Hackerrank Solution in C++ | 1 Click Solution

Find out the Mini-Max Sum Hackerrank Solution in C++| This Find out the Mini-Max Sum Hackerrank Solution in C++| problem is very popular and important in hacker rank. In min-max sum problem, we have 5 number as input and we have to find the sum of 4 elements in this way that 4 number out of 5 number sum should be maximum and same for a minimum sum of an array. I am going to tell to problem statement step by step with full explanation trust me this is the simplest problem.

Mini Max Sum Hackerrank Solution in C++

First, take an input of any number by the user after that add all number and sort the array and after sorting an array remove first index element and last index element from an array if you get than ok if not see the below full explanation of the problem min-max sum.

Mini-Max Sum Hackerrank Solution Problem Statement


Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers. Read program statement to find the Mini-Max Sum Hackerrank Solution in C++.

For example, arr = [1,3,5,7,9]. Our minimum sum is 1 + 3 + 5 + 7 = 16 and our maximum sum is 3 + 5 + 7 + 9 = 24. We would print

16 24

Function Description

Complete the miniMaxSum function in the editor below. It should print two space-separated integers on one line: the minimum sum and the maximum sum of 4 of 5 elements.

miniMaxSum has the following parameter(s):

arr: an array of 5 integers

Input Format

A single line of five space-separated integers.

Constraints

1<=arr[i]<=10^9

Output Format

Print two space-separated long integers denoting the respective minimum and maximum values that can be calculated by summing exactly four of the five integers. (The output can be greater than a 32-bit integer.)

Sample Input

1 2 3 4 5

Sample Output

10 14

Mini-Max Sum Hackerrank Solution

Mini-Max Sum Explanation


Our initial numbers are 1, 2, 3, 4, and 5. We can calculate the following sums using four of the five integers:

  1. If we sum everything except 1, our sum is 2+3+4+5=14.
  2. If we sum everything except 2, our sum is 1+3+4+5=13.
  3. If we sum everything except 3, our sum is 1+2+4+5=12.
  4. If we sum everything except 4, our sum is 1+2+3+5=11.
  5. If we sum everything except 5, our sum is 1+2+3+4=10.

Hints: Beware of integer overflow! Use 64-bit Integer.

The logic to Mini-Max Sum Hackerrank Solution in C++


The First step is to take an input from the user and after that take another variable to add all 5 number of an array and store the sum of 5 variable in sum name variable for better understanding let's take an example to suppose array 5 elements are 2, 5, 1, 4, 3. The logic is very easy to find Mini Max Sum Hackerrank Solution in C++.

for(i=0; i<5; i++)
{
        cin>>val;
        sum+=val;
        //cout<<sum<<" ";
        array.push_back(val);
}
 
The total sum of 5 elements is = 15

So the sum of the 5 variables in an array is 15, Now next step to sort the array, for sorting I am using sort function of a vector by default it sorts an array ascending order for our array element become after sorting.

Sort function of a vector

sort(array.begin(), array.end());

After sorting the elements of an array

1, 2, 3, 4, 5

Note:
You can use here Bubble Sort, Selection Sort, Insertion Sort and many other Different Types of Sorting.

Now we know that small element and big element in the array so just minus the small and big element of an array in this way we can get a Min-Max Sum of an array.

Max sum = sum - array[array first index element]
Min-Sum = sum - array[array last index element]
Max sum = 15 - 1 = 14
Min-Sum = 15 - 5 = 10

So hence we get our answer according to problem statements in hackerrank.

Submit your solution here: Click here

Tip: Before copy the program I recommended please read this full article, this will help you to understand the below Mini Max Hackerrank Solution in C++. Solve the problem by using above any sorting like- Bubble Sort, Selection Sort, Insertion Sort.

Mini Max Sum Hackerrank Solution in C++


#include <bits/stdc++.h>
using namespace std;
int main() 
{
int val,i;
long long int sum=0;
vector<int> array;
for(i=0; i<5; i++)
{
        cin>>val;
        sum+=val;
        //cout<<sum<<" ";
        array.push_back(val);
}
//cout<<endl;
        sort(array.begin(), array.end());   
        
/*for(i=0; i<5; i++)
{
 cout<<array[i]<<endl;
}*/
        cout<<sum-array[4]<<" "<<sum-array[0];  
        return 0;
}

Mini-Max Sum Hackerrank Solution in C++ Output

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me

1 comment:

  1. can you tell me why my code fails:

    void miniMaxSum(vector arr)
    {
    int l = arr.size();
    sort(arr.begin(),arr.end());
    long long int min = arr[0] + arr[1] + arr[2] + arr[3];
    long long int max = arr[l - 1] + arr[l - 2] + arr[l - 3] + arr[l-4];
    cout<<min<<" "<<max<<endl;
    }

    ReplyDelete