// set::lower_bound/upper_bound
#include <iostream>
#include <set>
int main ()
{
std::set<int> myset;
std::set<int>::iterator itlow,itup;
for (int i=1; i<10; i++) myset.insert(i*10); // 10 20 30 40 50 60 70 80 90
itlow=myset.lower_bound (30); // ^
itup=myset.upper_bound (60); // ^
myset.erase(itlow,itup); // 10 20 70 80 90
std::cout << "myset contains:";
for (std::set<int>::iterator it=myset.begin(); it!=myset.end(); ++it)
std::cout << ' ' << *it;
std::cout << '\n';
return 0;
}
Ly8gc2V0Ojpsb3dlcl9ib3VuZC91cHBlcl9ib3VuZAojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlIDxzZXQ+CgppbnQgbWFpbiAoKQp7CiAgc3RkOjpzZXQ8aW50PiBteXNldDsKICBzdGQ6OnNldDxpbnQ+OjppdGVyYXRvciBpdGxvdyxpdHVwOwoKICBmb3IgKGludCBpPTE7IGk8MTA7IGkrKykgbXlzZXQuaW5zZXJ0KGkqMTApOyAvLyAxMCAyMCAzMCA0MCA1MCA2MCA3MCA4MCA5MAoKICBpdGxvdz1teXNldC5sb3dlcl9ib3VuZCAoMzApOyAgICAgICAgICAgICAgICAvLyAgICAgICBeCiAgaXR1cD1teXNldC51cHBlcl9ib3VuZCAoNjApOyAgICAgICAgICAgICAgICAgLy8gICAgICAgICAgICAgICAgICAgXgoKICBteXNldC5lcmFzZShpdGxvdyxpdHVwKTsgICAgICAgICAgICAgICAgICAgICAvLyAxMCAyMCA3MCA4MCA5MAoKICBzdGQ6OmNvdXQgPDwgIm15c2V0IGNvbnRhaW5zOiI7CiAgZm9yIChzdGQ6OnNldDxpbnQ+OjppdGVyYXRvciBpdD1teXNldC5iZWdpbigpOyBpdCE9bXlzZXQuZW5kKCk7ICsraXQpCiAgICBzdGQ6OmNvdXQgPDwgJyAnIDw8ICppdDsKICBzdGQ6OmNvdXQgPDwgJ1xuJzsKCiAgcmV0dXJuIDA7Cn0=
MTAKYWJhCmdlZWtzZm9yZ2Vla3MKZ2Vla3Nmb3JnZWVrcwpnZWVrc2ZvcmdlZWtzCmdlZWtzZm9yZ2Vla3MKZ2Vla3Nmb3JnZWVrcwpnZWVrc2ZvcmdlZWtzCmdlZWtzZm9yZ2Vla3MKZ2Vla3Nmb3JnZWVrcwpnZWVrc2ZvcmdlZWtz
10
aba
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks