2.2.13.1 Sets - counting and searching

#include <iostream>
#include <set>
#include <functional>

using namespace std;

void find_count(set<double,greater<double >>v,double val) {
    if (v.count(val) > 0) {
        cout << val << " ";
        v.erase(val);
        for (auto i = v.begin(); i != v.end(); i++) {
            cout << *i << " ";
        }
    }
        else
            cout << "Not found ";
}

int main() {

    set <double, greater<double>> valuesA = { -1.1, 2.9, -2.3, 2.71 };
    set <double, greater<double>> valuesB = { -3.14, 2.71, -3.88, 2.19 };
    double value;
    cin >> value;

    find_count(valuesA,value);
    find_count(valuesB,value);

    return 0;
}