#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
const int N = 4e5+7;
int arr[N], cnt[N], mmz[N];
int32_t main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n; cin >> n;
for(int i = 1; i <= n; i++) cin >> arr[i];
for(int i = 1; i <= n; i++) cnt[arr[i]+1]++;
for(int i = 2; i < N; i++) cnt[i] += cnt[i-1];
int mx = 0;
sort(arr+1, arr+n+1);
for(int i = 1; i <= n; i++){
int cmp = 0;
if(mmz[arr[i]] > 0) continue;
for(int j = arr[i]; j <= arr[i]*(arr[n]/arr[i]); j+=arr[i]){
cmp += ((cnt[j+arr[i]] - cnt[j])*j);
}
mmz[arr[i]] = 1;
mx = max(mx, cmp);
}
cout << mx;
}
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |