백준 2217 c++

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int N;
vector <int> rope;

void input_rope()
{
	int i, temp;

	for (i = 0; i < N; i++)
	{
		cin >> temp;
		rope.push_back(temp);
	}

	return;
}

int find_result()
{
	int result = 0, sum = 0;
	int i;

	sort(rope.begin(), rope.end());
	for (i = 0; i < N; i++)
	{
		sum = (N - i) * rope[i];
		if(sum > result)
		{
			result = sum;
		}
		else
		{
			;
		}
	}

	return result;
}

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> N;
	input_rope();
	cout << find_result() << "\n";

	return 0;
}