[BOJ] 블랙잭 / 브론즈2 / 20분(X) -m "https://www.acmicpc.net/problem/10818"

Author: learntosurf

learntosurf/Baekjoon/12_브루트 포스/2798.py

@@ -0,0 +1,16 @@
+```
+# 내 풀이 
+N, M = map(int, input().split())
+nums = list(map(int, input().split()))
+
+sum = 0
+
+for i in range(N):
+    for j in range(i+1, N):
+        for k in range(j+1, N):
+            if nums[i] + nums[j] + nums[k] > M:
+                continue
+            else:
+                sum = max(sum, nums[i] + nums[j] + nums[k])
+print(sum)
+```