Лабораторная работа 27

gistfile1.txt

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class AddConst {
    int k;
public:
    AddConst(int value) : k(value) {}
    void operator()(int& x) { x += k; }
};

class SubConst {
    int k;
public:
    SubConst(int value) : k(value) {}
    void operator()(int& x) { x -= k; }
};

class DescSort {
public:
    bool operator()(int a, int b) { return a > b; }
};

int main() {
    vector<int> v = {5, 2, 8, 2, 10, 3};

    cout << *min_element(v.begin(), v.end()) << endl;
    cout << *max_element(v.begin(), v.end()) << endl;

    sort(v.begin(), v.end());
    for (int x : v) cout << x << " ";
    cout << endl;

    sort(v.begin(), v.end(), DescSort());
    for (int x : v) cout << x << " ";
    cout << endl;

    for_each(v.begin(), v.end(), AddConst(3));
    for (int x : v) cout << x << " ";
    cout << endl;

    for_each(v.begin(), v.end(), SubConst(2));
    for (int x : v) cout << x << " ";
    cout << endl;

    v.erase(remove(v.begin(), v.end(), 5), v.end());
    for (int x : v) cout << x << " ";
}