# 백준 11399번 ATM
n = int(input())
jul = list(map(int,input().split()))
jul.sort()
waiting = 0
for i in range(len(jul)):
waiting += jul[i] * (len(jul)-i)
print(waiting)
저번에 풀었을 때에 비해 아주 조금..!! 나아졌다
N = int(input())
time = []
sum = 0
time = list(map(int, input().split()))
time = sorted(time)
for i in range(len(time)):
sum += time[i] * N
N -= 1
print(sum)
저번 풀이
Uploaded by Notion2Tistory v1.1.0