백준 1037번 : 약수

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int cnt;
    cin >> cnt;
    
    vector<int> divisors(cnt);
    for (int i = 0; i < cnt; i++) {
        cin >> divisors[i];
    }

    sort(divisors.begin(), divisors.end());

    int minDivisor = divisors[0];
    int maxDivisor = divisors[cnt - 1];
    
    cout << minDivisor * maxDivisor << '\n';
}