2217번: 로프

#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main()
{
    int nNum[100001], n, max = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i)
        scanf("%d", nNum + i);
    sort(nNum, nNum + n, greater<int>());
    for (int i = 0; i < n; ++i)
        max = (max < nNum[i] * (i + 1)) ? nNum[i] * (i + 1) : max;
    printf("%d", max);
}