-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathminMax.java
49 lines (37 loc) · 1.23 KB
/
minMax.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
42
43
44
45
46
47
48
49
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
public static void miniMaxSum(List<Integer> arr) {
long total =0;
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;
for(int i=0; i<arr.size();i++){
total +=arr.get(i);
if(arr.get(i)<min) min = arr.get(i);
if(arr.get(i)>max) max = arr.get(i);
}
// To find Min -> we need to find the max element in the list
long minSum = total - max;
long maxSum = total - min;
System.out.println(minSum+" "+maxSum);
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
List<Integer> arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
Result.miniMaxSum(arr);
bufferedReader.close();
}
}