WA
#include <iostream>
using namespace std;
const int N = 105;
int a[N];
int main()
{
int n, minn;
scanf("%d%d", &n, &minn);
int maxn = 0;
for (int i = 0; i < n; ++i)
{
scanf("%d", &a[i]);
maxn = max(maxn, a[i]);
}
int res = 0;
for (int i = minn; i <= maxn; ++i)
{
int t = 0;
for (int j = 0; j < n; ++j)
t += a[j] / i;
res = max(res, t * i);
}
printf("%d", res);
return 0;
}
AC
#include <iostream>
using namespace std;
const int N = 1005;
int a[N];
int main()
{
int n, minn;
scanf("%d%d", &n, &minn);
int maxn = 0;
for (int i = 0; i < n; ++i)
{
scanf("%d", &a[i]);
maxn = max(maxn, a[i]);
}
int res = 0;
for (int i = minn; i <= maxn; ++i)
{
int t = 0;
for (int j = 0; j < n; ++j)
t += a[j] / i;
res = max(res, t * i);
}
printf("%d", res);
return 0;
}