Mini Max Sum | Hacker Rank Solution in Java

Problem:

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.

For example, . Our minimum sum is  and our maximum sum is . We would print

16 24

Solution:

import java.io.*;

import java.math.*;

import java.security.*;

import java.text.*;

import java.util.*;

import java.util.concurrent.*;

import java.util.regex.*;

public class Solution {

    static void miniMaxSum(int[] arr) {

int l=arr.length;

//sort

for(int i=0;i<l;i++)

{

    for(int j=i+1;j<l;j++)

    {

        if(arr[i]>arr[j])

        {int temp;

        temp=arr[i];

        arr[i]=arr[j];

        arr[j]=temp;

        }

    }

}

long min=0;

long max=0;

for(int i=0;i<l-1;i++)

min+=arr[i];

for(int i=1;i<l;i++)

max+=arr[i];

System.out.println(min+" "+max);

    }

    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {

        int[] arr = new int[5];

        String[] arrItems = scanner.nextLine().split(" ");

        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

        for (int i = 0; i < 5; i++) {

            int arrItem = Integer.parseInt(arrItems[i]);

            arr[i] = arrItem;

        }

        miniMaxSum(arr);

        scanner.close();

    }

}