[백준 문제풀이] 얼렁뚱땅 2217번 로프 문제 풀이

https://www.acmicpc.net/problem/2217

 

풀이

n = int(input())
weight = [int(input()) for _ in range(n)]

weight.sort(reverse=True)

max_list = []
for i in range(n) :
	max_list.append(weight[i] * (i+1))

print(max(max_list))