백준/Greedy
[그리디/백준] 11399번: ATM
ydin
2022. 6. 23. 10:11
-문제: https://www.acmicpc.net/problem/11399
-정답풀이:
n=int(input())
data=list(map(int,input().split()))
data.sort()
answer=[0]*n
answer[0]=data[0] #초기화해야지 안 틀린다!
for i in range(1,n):
answer[i]=answer[i-1]+data[i]
print(sum(answer))