[SWEA] 백만 장자 프로젝트 / D2 / 30분

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5LrsUaDxcDFAXc

Author: YoonYn9915

YoonYn9915/implementation/2024-11-23-[SWEA]-#1859-백만 장자 프로젝트.py

@@ -0,0 +1,20 @@
+N = int(input())
+ansList = []
+
+for i in range(N):
+    days = int(input())
+    costs = list(map(int, input().split()))
+    ans = 0
+
+    maxCost = -1
+
+    for j in range(len(costs) - 1, -1, -1):
+        if maxCost > costs[j]:
+            ans += maxCost - costs[j]
+        else:
+            maxCost = costs[j]
+
+    ansList.append(ans)
+
+for i in range(len(ansList)):
+    print(f"#{i + 1} {ansList[i]}")