[Dev-Ping9] 백준 1037번 - 약수

 

 

# 문제 설명

 오름차순으로 정렬한다.

 

 

 

# 코드 구현

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main{
    static int[] nums;
    
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        nums=new int[n];
        for(int i=0; i<n ; i++){
            nums[i]= Integer.parseInt(st.nextToken());
        }

        Arrays.sort(nums);

        if(n%2 !=0 ){
            System.out.println(nums[n/2] * nums[n/2]);
        }else{
            System.out.println(nums[0]*nums[nums.length-1]);
        }
    }
}