๐Ÿค–/๋ฐฑ์ค€

๋ฐฑ์ค€ 2798: ๋ธ”๋ž™์žญ (Python)

sssbin 2021. 9. 8. 18:22

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

 

2798๋ฒˆ: ๋ธ”๋ž™์žญ

์ฒซ์งธ ์ค„์— ์นด๋“œ์˜ ๊ฐœ์ˆ˜ N(3 ≤ N ≤ 100)๊ณผ M(10 ≤ M ≤ 300,000)์ด ์ฃผ์–ด์ง„๋‹ค. ๋‘˜์งธ ์ค„์—๋Š” ์นด๋“œ์— ์“ฐ์—ฌ ์žˆ๋Š” ์ˆ˜๊ฐ€ ์ฃผ์–ด์ง€๋ฉฐ, ์ด ๊ฐ’์€ 100,000์„ ๋„˜์ง€ ์•Š๋Š” ์–‘์˜ ์ •์ˆ˜์ด๋‹ค. ํ•ฉ์ด M์„ ๋„˜์ง€ ์•Š๋Š” ์นด๋“œ 3์žฅ

www.acmicpc.net

 

n, m = map(int, input().split())
cards = list(map(int, input().split()))
list = []

for i in range(0,n-2):
    for j in range(i+1,n-1):
        for k in range(j+1, n):
            if cards[i] + cards[j] + cards[k] <= m:
                list.append(cards[i] + cards[j] + cards[k])

print(max(list))