#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
vector<int> coll;
for(int i = 1; i <= 13; ++i)
{
coll.push_back(i);
}
//查找元素值 小于等于10 的元素的个数
//也就是使得 !(10 < elem) 成立的元素个数
int res = count_if(coll.begin(), coll.end(), not1(bind1st(less<int>(), 10)));
cout<<"[!(10 < elem)]: "<<res<<endl; //Output: [!(10 < elem)]: 10
vector<int> col2;
col2.push_back(9);
col2.push_back(5);
col2.push_back(7);
col2.push_back(3);
col2.push_back(1);
col2.push_back(4); //Before sort: 9,5,7,3,1,4
sort(col2.begin(), col2.end(), not2(less<int>())); //Here: 9,7,5,4,3,1
//sort(col2.begin(), col2.end(), less<int>()); //Here: 1,3,4,5,7,9
return 0;
}