1 #include <iostream>
 2 #include <string>
 3 #include <list>
 4 using namespace std;
 5
 6 class A{
 7 private:
 8     string name;
 9 public:
10     A(string n) :name(n){}
11     friend bool operator < (const class A& a1, const class A &a2);
12     friend bool operator == (const class A &a1, const class A &a2){
13         if (a1.name.size() == a2.name.size())
14             return true;
15         else
16             return false;
17     }
18     friend ostream & operator << (ostream &o, const A &a){
19         o << a.name;
20         return o;
21     }
22     string get_name() const{
23         return name;
24     }
25     int get_size() const{
26         return name.size();
27     }
28 };
29 // 在此处补充你的代码
30 bool operator< (const A& a1, const A &a2) {
31     return a1.name.size() < a2.name.size();
32 };
33
34 template <class Iterator, class Function>
35 void Show(Iterator begin, Iterator end, Function print) {
36     for (Iterator iterator1 = begin; iterator1 != end; iterator1++) {
37         print(*iterator1);
38     }
39 };
40
41 class Print {
42 public:
43     void operator()(const A &a) {
44         cout << a.get_name()<< " ";
45     }
46 };
47
48 template <class A>
49 struct MyLarge {
50     inline bool operator()(const A &a1, const A &a2) {
51         return a1.get_name() < a2.get_name();
52     }
53 };
54
55 int main(int argc, char* argv[])
56 {
57     list<A> lst;
58     int ncase, n, i = 1;
59     string s;
60     cin >> ncase;
61     while (ncase--){
62         cout << "Case: "<<i++ << endl;
63         cin >> n;
64         for (int i = 0; i < n; i++){
65             cin >> s;
66             lst.push_back(A(s));
67         }
68         lst.sort();
69         Show(lst.begin(), lst.end(), Print());
70
71         cout << endl;
72         lst.sort(MyLarge<A>());
73         Show(lst.begin(), lst.end(), Print());
74         cout << endl;
75         lst.clear();
76     }
77     return 0;
78 }