codeforce - Divisors of Two Integers

#include<bits/stdc++.h>
using namespace std;
#define fastread()(ios_base::sync_with_stdio(false),cin.tie(NULL));
#define ll long long
int main()
{
    fastread()
    ll n;
    cin>>n;
    ll ara[n+1],mx=0,i,j,mn=0,sub=0;
    map<ll,ll>mp;
    for(i=0;i<n;i++)
    {
        cin>>ara[i];
        mx=max(mx,ara[i]);
        mp[ara[i]]++;
        if(mp[ara[i]]>mn)
        {
            mn=mp[ara[i]];
            sub=ara[i];
        }
        if(mp[ara[i]]==mn)
        {
            sub=max(ara[i],sub);
        }
    }
    sort(ara,ara+n);
    i=n-1;
    while(i>=0)
    {
        if(mx%ara[i]!=0)
        {
            mn=ara[i];
            break;
        }
        i--;
    }
    if(i<0)mn=sub;
    cout<<mx<<" "<<mn<<endl;
    return 0;
}