2017-02-16 23:51:56 -06:00
|
|
|
// Author: Rodney Shaghoulian
|
2018-07-27 16:45:56 -07:00
|
|
|
// Github: github.com/RodneyShag
|
|
|
|
|
// HackerRank: hackerrank.com/RodneyShag
|
2017-02-16 23:51:56 -06:00
|
|
|
|
|
|
|
|
import java.util.Scanner;
|
|
|
|
|
|
|
|
|
|
// Runtime: O(n)
|
|
|
|
|
// Space Complexity: O(1)
|
|
|
|
|
public class Solution {
|
|
|
|
|
public static void main(String[] args) {
|
|
|
|
|
Scanner scan = new Scanner(System.in);
|
|
|
|
|
long sum = 0;
|
|
|
|
|
long min = Integer.MAX_VALUE;
|
|
|
|
|
long max = Integer.MIN_VALUE;
|
|
|
|
|
for (int i = 0; i < 5; i++) {
|
|
|
|
|
long num = scan.nextLong();
|
|
|
|
|
sum += num;
|
|
|
|
|
min = Math.min(min, num);
|
|
|
|
|
max = Math.max(max, num);
|
|
|
|
|
}
|
|
|
|
|
scan.close();
|
|
|
|
|
System.out.print((sum - max) + " " + (sum - min));
|
|
|
|
|
}
|
|
|
|
|
}
|