题解 | 字符串排序

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
struct node{
    string str;
    int length;
    node(){}
};
const int MAXN =100;
node arr[MAXN];
bool compare(const node&a,const node&b){
    return a.length<b.length;
}
int main(){
    int n;
    string ans;
    while(scanf("%d",&n) != EOF){
        getchar();
        int num=0;
        for(int i=0;i<n;i++){
            getline(cin,ans);
            if(ans == "stop") break;
            num++;
            arr[i].str =ans;
        }
        for(int i=0;i<num;i++){
            arr[i].length = arr[i].str.size();
        }
        sort(arr,arr+num,compare);
        for(int i=0;i<num;i++){
            cout<<arr[i].str<<endl;
        }
    }
    return 0;
}