binary search

ll l, r;
while (l+1 < r){
    ll m = (l + r) / 2;
    if (check(m)) {
        l = m;
    } else {
        r = m;
    }
}
ll res = check(r) ? r : l;