2990. 文献排序

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void lowerword(string &s) {
        for (int i = 0; i < s.size(); i++) {
            s[i] = tolower(s[i]);
        }
}
bool cmp(string s1, string s2) {
    lowerword(s1), lowerword(s2);
    return s1 < s2; 
}
vector <string> words;
int main(void) {
    int T;
    cin >> T;
    int t = 0;
    while (T--) {
        int n;
        cin >> n;
        getchar();
        while (n--) {     
            string s;
            getline(cin, s);
            words.push_back(s);
        }
        sort(words.begin(), words.end(), cmp);

        cout << "case #" << t << ":" << endl;
        t++;
        for (auto x : words) {
            cout << x << endl;
        }      
        words.clear();
    }
    return 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
class StrangeString
{
  private:
  public:
    string original;
    StrangeString() : original("")
    {
    }
    StrangeString(string s) : original(s)
    {
    }
    friend bool operator<(const StrangeString &left, const StrangeString &right)
    {
        string leftcpy = left.original;
        string rightcpy = right.original;
        transform(leftcpy.begin(), leftcpy.end(), leftcpy.begin(), ::tolower);
        transform(rightcpy.begin(), rightcpy.end(), rightcpy.begin(), ::tolower);
        return leftcpy < rightcpy;
    }
    friend istream &operator>>(istream &is, StrangeString &s)
    {
        getline(is, s.original);
        return is;
    }
    friend ostream &operator<<(ostream &os, const StrangeString &s)
    {
        os << s.original;
        return os;
    }
};
int main()
{
    int T;
    cin >> T;
    cin.get();
    for (int case_num = 0; case_num < T; case_num++)
    {
        cout << "case #" << case_num << ":" << endl;
        int n;
        cin >> n;
        cin.get();
        vector<StrangeString> arr(n);
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
        }
        sort(arr.begin(), arr.end());
        for (int i = 0; i < arr.size(); i++)
        {
            cout << arr[i] << endl;
        }
    }
    return 0;
}