排序
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
bool function(int a, int b)
{
return a < b;
}
int main()
{
vector<int >sort_;
sort_.push_back(2);
sort_.push_back(22);
sort_.push_back(42);
sort_.push_back(20);
sort_.push_back(12);
sort(sort_.begin(), sort_.end(), function);
return 0;
}