-
Notifications
You must be signed in to change notification settings - Fork 111
/
solution.java
41 lines (38 loc) · 1.26 KB
/
solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
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 {
// Complete the miniMaxSum function below.
static void miniMaxSum(int[] arr) {
//Set the min, max and sum
long sum = 0;
long min = Integer.MAX_VALUE;
long max = Integer.MIN_VALUE;
//Iterate through the array and update the sum, min and max
for (int i = 0; i < arr.length; i++) {
long num = arr[i];
sum += num;
min = Math.min(min, num);
max = Math.max(max, num);
}
//Finally print out the difference between (sum and max) and (sum and min)
System.out.print((sum - max) + " " + (sum - min));
}
/* Driver Code */
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();
}
}