BAEKJOON PYTHON 2798 블랙잭

Prob

---

Approach

브루트 포스 과제 이므로 전수조사한다.

---

Code

if __name__ == "__main__" :
    N, M = map(int, input().split())
    a = list(map(int, input().split()))
    a.sort()
    near_sum = a[0] + a[1] + a[2]
    for i in range(N - 2):
        for j in range(i + 1, N - 1):
            for k in range(j + 1, N):
                if (M - (a[i] + a[j] + a[k]) < M - near_sum) and M - (a[i] + a[j] + a[k]) >= 0:
                    near_sum = a[i] + a[j] + a[k]

    print(near_sum)

 

출처

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