What I always found weird and verbose were all the algorithms taking begin-end iterator pairs, like:

    std::sort(my_container.begin(), my_container.end());

I mean, yes, in 0.1% of all cases I would want to sort something that is not an entire container, and for that it's great that this exists. But for the 99.9%, why isn't there an overload that would allow me to do:

    std::sort(my_container);