Submission #56336232

---

Source Code Expand

from typing import Callable


def bisect(ok: int, bad: int, pred: Callable[[int], bool]) -> int:
    if not pred(ok):
        return ok

    while bad - ok > 1:
        mid = ok + (bad - ok) // 2
        (ok := mid) if pred(mid) else (bad := mid)

    return bad


def main():
    n, m = map(int, input().split())
    a = [*map(int, input().split())]

    oo = 10**15
    res = bisect(0, oo, lambda x: sum(min(ai, x) for ai in a) <= m)

    if res < oo:
        print(res - 1)
    else:
        print("infinite")


main()

Submission Info

Judge Result