c++ - how to insert in sorted order

Question

I know that std::find() helps to find the iterator position of a given value. And std::insert() insert a given value into the container at a known position.

However, is there any function I can call which returns which position a new value should be inserted into according to alphabetical order in standard library?

For example, if a queue is A23, A34, B59, D49. If a supplement C50, then a function like std::foo() returns the position between B59 and D49. So I can then call std::insert() to finish the job?

Answer 1

std::lowerbound関数とのペアはstd::upperbound、ベクトルをソートされた順序で保持する挿入ポイントへの反復子を提供します。同じ値を持つ要素が既に存在する場合、lowerboundは既存の値の前に挿入ポイントをupperbound与え、 は後ろにポイントを与えます。upperbound安定したソートが必要な場合に使用します。