STL Пересечение множества и вектора

typedef std::uniform_int_distribution   < int   >   T_int_distribution;
 
void main()
{
    map<int, int>::iterator  Iter11, Iter22;
    vector <int> v, v1;
    map <int, int> m;
    vector<int>::iterator pIter, Iter1, Iter2, Result3;
    multiset <int> ms1;
 
 
    static  default_random_engine  rand_generator(unsigned(time(0)));
 
    
    for (int i = 0; i < 10; ++i)
    {
        
        v.push_back(T_int_distribution(1, 9)  (rand_generator));
        m[i] = T_int_distribution(1, 9)  (rand_generator);
    }
        
    for (int i = 0; i < 5; i++)
    {
        m.erase(m.begin());
 
    }
 
    for (pIter = v.begin(); pIter != v.end(); pIter++)
        cout << " " << *pIter;
 
    v.erase(v.begin(), v.begin()+5);
 
    cout << "\nAfter the middle two elements are deleted,"
        << " the map m2 is:";
    for (pIter = v.begin(); pIter != v.end(); pIter++)
        cout << " " << *pIter;
 
    sort(v.begin(), v.end());
    
    Result3 = set_intersection(v.begin(), v.end(),
        m.begin(), m.end(), v1.begin(), mod_lesser);
    cout << "Intersection of source ranges with binary predicate "
        << "mod_lesser specified,\n vector v3mod  = ";;
    for (pIter = v1.begin(); pIter != Result3; ++pIter)
        cout << *pIter << " ";
    cout << endl;
 
    system("pause");
}

#include <iostream>
#include <map>
#include <vector>
#include <stdlib.h>
#include <set>
#include <time.h>
#include <random>
#include <algorithm>
 
using namespace std;
 
 
map <int, int> m, msinh;
vector <int> v, vsinh;
typedef uniform_int_distribution  < int>  T_int_distribution;
 
void sinhronizate()
{
    vector<int>::iterator IterVec;
    map<int, int>::iterator  IterMap;
    typedef pair <int, int> Int_Pair;
    
    for (IterVec = v.begin(); IterVec != v.end(); IterVec++)
    {
        for (IterMap = m.begin(); IterMap != m.end(); IterMap++)
        {
            if (*IterVec == IterMap->second)
            {           
                msinh.insert(Int_Pair(IterMap->first, *IterVec));
                vsinh.push_back(*IterVec);
                m.erase(IterMap->first);
                break;
            }
        }
    }
}
 
void main()
{
    static  default_random_engine  rand_generator(unsigned(time(0)));
 
    vector<int>::iterator IterVec;
    map<int, int>::iterator  IterMap;
 
    for (int i = 0; i < 10; ++i)
    {
        v.push_back(T_int_distribution(1, 9)  (rand_generator));
        m[i] = T_int_distribution(1, 9)  (rand_generator);
    }
        
    cout <<"Vector: ";
    for (IterVec = v.begin(); IterVec != v.end(); IterVec++)
        cout << " " << *IterVec;
 
    cout << "\nMap:    ";
    for (IterMap = m.begin(); IterMap != m.end(); IterMap++)
        cout << " " << IterMap->second;
 
    int number = T_int_distribution(1, 3)  (rand_generator);
 
    cout << "\nDelete " << number << " elements";
    
    for (int i = 0; i < number; i++)
    {
        m.erase(m.begin());
    }
 
    v.erase(v.begin(), v.begin() + number);
 
    cout << "\nVector is erased:";
    for (IterVec = v.begin(); IterVec != v.end(); IterVec++)
        cout << " " << *IterVec;
 
    cout << "\nMap is erased:   ";
    for (IterMap = m.begin(); IterMap != m.end(); IterMap++)
        cout << " " << IterMap->second;
 
    cout << "\n";
 
    sinhronizate();
 
    cout << "\nIntersection of two containers";
    cout << "\nContent of vector: ";
    for (IterVec = vsinh.begin(); IterVec != vsinh.end(); ++IterVec)
        cout << *IterVec << " ";
    cout << "\nContent of map:    ";
    for (IterMap = msinh.begin(); IterMap != msinh.end(); ++IterMap)
        cout << IterMap->second << " ";
    cout << endl;
 
    system("pause");
}