STL LIST中自定义排序函数例子

#include <iostream>#include <list>using namespace std;template<typename kk>class myComp{public:    bool operator()(const kk& left,const kk& right)    {        return left > right;    }};int main(){    std::list<int>  iList;    list <int>::iterator c1_Iter;    iList.push_back( 20 );    iList.push_back( 10 );    iList.push_back( 30 );    for ( c1_Iter = iList.begin( ); c1_Iter != iList.end( ); c1_Iter++ )        cout << " " << *c1_Iter;    cout << endl;    iList.sort(myComp<int>());    for ( c1_Iter = iList.begin( ); c1_Iter != iList.end( ); c1_Iter++ )        cout << " " << *c1_Iter;    cout << endl;    return 0;}

运行结果

 20 10 30 30 20 10Process returned 0 (0x0)   execution time : 1.750 sPress any key to continue.