개발자(진) 옞

🤑https://www.acmicpc.net/problem/6236 내 풀이N, M = map(int, input().split())money = [int(input()) for _ in range(N)]s, e = max(money), sum(money)ans = 0while s mid: result = 0 total += 1 result += m if result > 0: total += 1 if total > M: s = mid + 1 else: e = mid - 1 ans = midprint(ans)  코드 설명s, e = max(money), sum(money)s: 인출할 금..

🎸https://www.acmicpc.net/problem/2343  내 풀이N, M = map(int, input().split())guitar = list(map(int, input().split()))s, e = max(guitar), sum(guitar)ans = 0while s mid: total += 1 current = 0 current += g if current > 0: total += 1 if total > M: # 강의 길이를 늘려야 함 s = mid + 1 else: e = mid - 1 ans = midprint(ans)  코드 설명s, e = max(guita..

🌳 https://www.acmicpc.net/problem/2805  내 풀이def cutter(): s = 0 e = max(trees) height = 0 while s mid: total += i - mid if total >= M: s = mid + 1 height = mid else: e = mid - 1 return heightN, M = map(int, input().split())trees = list(map(int, input().split()))print(cutter())  코드 설명 이진 탐색(이분 탐색) 문제였다. ✔️ cutter 함수 내s..