自定义容器顺序

#include <set>#include <iostream>using namespace std;template<typename T>void print(T b, T e, char c=' '){while(b!=e)cout << *b++ << c;if(c!='\n') cout << endl;}template<typename K, typename V>ostream& operator<<(ostream& o, const pair<K,V>& p){return o << p.first << ':' << p.second;} <pre name="code" class="html">template<typename T>

struct myComp { bool operator() (const T &a, const T &b) { return a > b; //从大到小排序 //return a < b; //从小到大排序 } }; int main(){set<int,myComp<int> > ss;//set<char*> ss;配上char s[]ss.insert(20);ss.insert(10);ss.insert(2);ss.insert(0);ss.insert(29);ss.insert(21);ss.insert(200);print(ss.begin(),ss.end());}