I am trying to use use std::set_intersection to find common elements between 2 completely different types of data structures that have a common binding \'na
use std::copy_if and lambda that searches inside vectorB using std::binary_search
be sure to sort using the same predicate you will give to binary_search
this solves similar problem:
elegant way to remove all elements of a vector that are contained in another vector?