[백준/수학/C++] 1037번 약수

https://www.acmicpc.net/problem/1037

1037번: 약수

#include <bits/stdc++.h>

using namespace std;


int main(void) {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n;
    vector<int> v;
    cin >> n;
    for(int i=0; i<n; i++){
        int x;
        cin >> x;
        v.push_back(x);
    }
    sort(v.begin(), v.end());

    if(v.size()==1)
        cout << v[0]*v[0];
    else
        cout << v[0]*v[v.size()-1];

    return 0;
}