How to improve the deletion speed of sequential class containers?

for example vector
1.iterator_swap Swap what the two iterators point to （ One of them points to the element to be deleted , Another one points to the last element of the container ）

2. After the exchange ,pop_back End element .

The algorithm complexity of the above method is O（1）, After deleting one of the elements , Lead to a large number of elements , Problems that need to move forward .