Thread: vectors with same iterators

A solution could be to get the iterator to the max element as you did, then iterate over all elements and compare the iterator value until you find the correct one. Not the most elegant solution, but couldn't figure out something better at the moment.

Code:

max = std::max_element(v1.begin(), v1.end());

i1 = v1.begin();
i2 = v2.begin();
while(i1 != v1.end())
{
  if(i1 == max)
  {
    v1.erase(i1);
    v2.erase(i2);
    break;
  }

  i1++;
  i2++;
}

The solution was already given, wasn't it?

Code:

int index = std::distance(vec.begin(), some_iterator_in_vec);

And to generate an iterator for another vector out of it:

Code:

vector<int>::iterator some_iterator_in_other_vec =
  std::advance(other_vec.begin(), index);

Never heard of or used std::advance or std::distance before. You learn something new every day.