Function contest_algorithms::order::slice_lower_bound

pub fn slice_lower_bound<T: PartialOrd>(slice: &[T], key: &T) -> usize

Assuming slice is sorted and totally ordered, returns the minimum i for which slice[i] >= key, or slice.len() if no such i exists