organizator

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MN = 2e6+100;
int t[MN];
int main() {
    ll n;
    cin>>n;
    for(ll i = 0; i < n; ++i) {
	int x;
	cin>>x;
	++t[x];
    }
    ll ans = 0;
    for(ll i = 1; i < MN; ++i) {
	ll q = 0;
	ll w = 0;
	for(ll j = 1; j*i < MN; ++j) {
	    q += t[j*i]*i;
	    w += t[j*i];
	}
	if(w >= 2) {
	    ans = max(ans, q);
	}
    }
    cout<<ans<<'\n';
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED