class Solution {
public int solution(int[] numbers) {
int answer = 0;
int max = 0;
int tem = 0;
for (int i = 0; i <numbers.length; i++){
if (max < numbers[i]) {
max = numbers[i];
tem = i;
}
}
for (int i = 0; i <numbers.length; i++){
if (tem != i && answer < numbers[i]*max) { //최댓값을 배열에서 제외시켜주기
answer = numbers[i]*max;
}
}
return answer;
}
}