lower_bound, upper_bound

int main(int argc, const char * argv[]) {
    int myints[] = {10,20,30,30,20,10,10,20};
    vector<int> v(myints,myints+8);           // 10 20 30 30 20 10 10 20
    
    sort (v.begin(), v.end());                // 10 10 10 20 20 20 30 30
    
    vector<int>::iterator low1,low2, up1, up2, up3;
    low1 = lower_bound (v.begin(), v.end(), 15); //^
    low2 = lower_bound (v.begin(), v.end(), 20); //^
    up1 = lower_bound (v.begin(), v.end(), 20); //^
    up2 = upper_bound (v.begin(), v.end(), 25); //
    up3 = upper_bound (v.begin(), v.end(), 100); //  =v.end()
    
    std::cout << "lower_bound for 15 is " << (low1- v.begin()) << ‘\n‘;
    std::cout << "lower_bound for 20 is " << (low2 - v.begin()) << ‘\n‘;
    std::cout << "upper_bound for 20 is " << (up1- v.begin()) << ‘\n‘;
    std::cout << "upper_bound for 25 is " << (up2 - v.begin()) << ‘\n‘;
    std::cout << "upper_bound for 100 is " << (up3 - v.begin()) << ‘\n‘;
    
    return 0;
}