C++------------------------------------------------------------- 排序

#include <iostream>#include <algorithm>#include <vector>using namespace std;int main(int argc, const char * argv[]) {        //排序：升序    vector<int> num;    num.push_back(4);    num.push_back(40);    num.push_back(14);    num.push_back(-4);    num.push_back(-47);    num.push_back(34);        sort(num.begin(), num.end(), [](int a,int b){ return (a<b);});        for (int i =0; i < num.size(); i++)    {        cout << num[i] <<"\n";    }    return 0;}

STL容器+lambda函数