Submission #259907

---

Source Code Expand

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
 
 
 
public class Main {
int n,k,max,t[];
ArrayList<Integer[]> y = new ArrayList<Integer[]>();
Scanner sc = new Scanner(System.in);
int counter = 0;
	public static void main(String[] args){	
		System.out.println(new Main().ans());
	}
	
	
	private int ans() {
		n = sc.nextInt();
		t  = new int[n];
		for(int i =0 ; i<n;i++){
			t[i] =  sc.nextInt();
		}
		Arrays.sort(t);
		int box1=0,box2=0;
		for(int i =n-1 ; i>=0;i--){
			if(box1<=box2){
				box1+=t[i];
			}else{
				box2+=t[i];
			}
		}
		return Math.max(box1,box2);
	}
}

Submission Info

Judge Result