题解 | 字符串排序

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

bool cmp(string& s1, string& s2) {
    return s1.length() <= s2.length();
}

int main() {
    int k;
    while (cin >> k) { // 注意 while 处理多个 case
        cin.ignore();
        string s1;
        string s2;
        string s3 = "stop";
        vector<string>v1;
        for (int i = 0; i < k; i++) {
            getline(cin, s1);
            if (s1 != s3)v1.push_back(s1);
            else break;
        }
        sort(v1.begin(), v1.end(), cmp);
        for (auto it = v1.begin(); it != v1.end(); it++)
            printf("%s\n", (*it).c_str());
    }
}
// 64 位输出请用 printf("%lld")