[Algorithm] 이진탐색 2512

2512

import sys
input = sys.stdin.readline
n = int(input())
s = list(map(int, input().split()))
m = int(input())
start, end = 0, max(s)
while start <= end:
    mid = (start + end) // 2
    num = 0
    for i in s:
        if i >= mid: num += mid
        else: num += i
    if num <= m: start = mid + 1
    else: end = mid - 1
print(end)

17266

N = int(input())
M = int(input())

data = list(map(int, input().split()))
start = 0

if len(data) == 1:
    start = max(data[0] - 0, N - data[0])
else:
    for i in range(len(data)):
        if i == 0:
            end = data[i] - 0
        elif i == len(data) - 1:
            end = N - data[i]
        else:
            tmp = data[i] - data[i-1]
            if tmp % 2:
                end = tmp // 2 + 1
            else:
                end = tmp // 2
        start = max(start, end)

print(start)

숫자골드 2613

못하겠다...