프로그래머스 - 최댓값 만들기 (2)

import java.util.Arrays;
class Solution {
    public int solution(int[] numbers) {
        Arrays.sort(numbers);
        int max = numbers[numbers.length-1] * numbers[numbers.length-2];
        int min = numbers[0] * numbers[1];
        if(max>min) return max;
        else return min;
    }
}