로프 C++

#include <iostream>
#include <algorithm>

using namespace std;
const int MAX = 100001;
int n;
int lope[MAX];

int main(void) {
	cin >> n;
	int answer = -1;

	for (int i = 0; i < n; i++)
		cin >> lope[i];

	sort(lope, lope + n);
	
	for (int j = 0; j < n; j++) {
		answer = max(answer, lope[j]*(n-j));
	}
	cout << answer << endl;
	return 0;
}