Submission #23746

---

Source Code Expand

import java.util.*;

public class Main {
	public static void sort(int[] n){
		for(int i = 0; i < n.length; i++){
			int max = i;
			for(int j = i+1; j < n.length; j++){
				if( n[j] > n[max] ){
					max = j; 
				}
			}
			int temp = n[max];
			n[max] = n[i];
			n[i] = temp;
		}
	}
	public static void solve(int[] len){
		sort(len);
		long sum = 0;
		for(int i = 1; i < len.length; i++){
			sum += len[i];
		}
		long min = len[0]-sum;
		if( min < 0 ){
			min = 0;
		}
		sum += len[0];
		long max = sum;
		System.out.println(max);
		System.out.println(min);
	}
	public static void main(String[] args){
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int[] len = new int[n];
		for(int i = 0; i < n; i++){
			len[i] = stdIn.nextInt();
		}
		solve(len);
	}

}

Submission Info

Judge Result