[Programmers] 저울 - 탐욕법(Greedy)

import java.util.Arrays;

// 저울 - 탐욕법(Greedy)
public class Scale {
	public int solution(int[] weight) {
		Arrays.sort(weight);
		int answer = weight[0];
		for (int i = 1; i < weight.length; i++) {
			if (answer < weight[i] - 1) {
				break;
			}
			answer += weight[i];
		}
		return answer + 1;
	}
}

• O(n) 이내 해결