Алгоритмы STL Удаление элементов в векторе

v.erase(remove_if(v.begin(), v.end(), [&value](int x){return x==value;}), v.end());

v.erase(v.remove(v.begin(),v.end(),value),v.end());

#include <iostream>     
#include <algorithm>    
#include <vector>
 
int main () {
int value = 1;  
  std::vector<int> vec=  {1,2,3,4,7,5,1,1};
  vec.erase(std::remove(vec.begin(),vec.end(),value),vec.end());
  for(const auto &el:vec)
    std::cout<<el<<" ";
 
  return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main()
{
    vector<int> vec={1,2,3,4,7,5,1,1};
    auto min=min_element(vec.begin(),vec.end());
 
     for (auto &i:vec) cout<<i<<"  ";
     cout<<"\n";
 
    vec.erase(std::remove(vec.begin(),vec.end(),*min),vec.end());
    for (auto &i:vec) cout<<i<<"  ";
}

vec.erase(std::remove(vec.begin(),vec.end(),(int)*min),vec.end());

#include <iostream>
#include <algorithm>
 
int max_elem = 0;
int min_elem = 0;
 
bool should_be_removed(int i)
{
    return (i == max_elem || i == min_elem);
}
 
int main()
{
    int myints[] = {1, 2, 3, 1, 5, 6, 9, 8, 9, 4, 7};
 
    // bounds of range:
    int* pbegin = myints;
    int* pend = myints + sizeof(myints) / sizeof(int);
 
    max_elem = *std::max_element(pbegin, pend);
    min_elem = *std::min_element(pbegin, pend);
 
    pend = std::remove_if(pbegin, pend, should_be_removed);
 
    std::cout << "the range contains:";
    for (int* p = pbegin; p! = pend; ++p)
    std::cout << ' ' << *p;
    std::cout << '\n';
 
    return 0;
}

    for(const auto &el: myints)
        std::cout << ' ' << el;