STL 中的排序用法
#include <iostream>
#include <stdlib.h>
#include <functional>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(void)
{
vector<string> v;
v.push_back("apple");
v.push_back("puppy");
v.push_back("andiord");
v.push_back("banana");
stable_sort(v.begin(), v.end(),
[](const string &left, const string &right) {
return left.size() < right.size();
});
// sort(v.begin(), v.end(), greater<string>());
for (auto i = v.begin(); i != v.end(); i++)
{
cout << *i << endl;
}
}