刚才在群里看别人发了一个题目

#include<iostream>
#include<algorithm>
using namespace std;

bool cmp(string a,string b) {
    //计算单词ASCII值，并转小写单词
    int sum1 = 0,sum2 = 0;
    for(int i = 0 ; i < a.size(); ++i) {
        sum1 += a[i];
        a[i] = tolower(a[i]);
    }
    for(int i = 0 ; i < b.size(); ++i) {
        sum2 += b[i];
        b[i] = tolower(b[i]);
    }
    if(a != b) return a < b;//比较小写单词 
    else return sum1 < sum2;//单词一样，就比较ASCII和 
}

int main() {
    int n;
    string str[100];
    cin>>n;
    for(int i = 0; i < n; ++i)//输入n个 单词
        cin>>str[i];
    sort(str,str+n,cmp);//根据转换成小写单词后的字典序，原单词的ASCII码，对单词排序
    for(int i = 0; i < n;++i){
        if(i > 0) printf(" ");
        cout<<str[i];
    }
    return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 10000;
struct Sstring {
    string str;
    int RANK = maxn;//记录输入先后 
} sstr[maxn];
bool cmp(Sstring a,Sstring b) {
    //全部转换成小写单词 
    for(int i = 0 ; i < a.str.size(); ++i) {
        a.str[i] = tolower(a.str[i]);
    }
    for(int i = 0 ; i < b.str.size(); ++i) {
        b.str[i] = tolower(b.str[i]);
    }
    if(a.str != b.str) return a.str < b.str;//比较小写单词
    else return a.RANK < b.RANK;//单词一样，就按输入先后排序
}

int main() {
    int n;
    cin>>n;
    for(int i = 0; i < n; ++i) {
        cin>>sstr[i].str;
        sstr[i].RANK = i;//记录输入先后 
    }
    sort(sstr,sstr+n,cmp);
    for(int i = 0; i < n; ++i) {
        if(i > 0) printf(" ");
        cout<<sstr[i].str;
    }
    return 0;
}