simple c++11ish heap

heap.cpp

    map<double, size_t> top;
    size_t max_size = 100;

    auto top_add = [&top,max_size](double value, size_t id)
    {
        if (top.size() < max_size)
            top.insert(make_pair(value, id));
        else
        {
            if (top.begin()->first < value)
            {
                top.erase(top.begin());
                top.insert(make_pair(value,id));
            }
        }
    };