题解 | 大整数排序

#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;
    string s[105];
    for (int i = 0; i < n; i++)
        cin >> s[i];
    for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++) {
            if (s[i].length() > s[j].length()) {
                string t = s[i];
                s[i] = s[j];
                s[j] = t;
            } else if (s[i].length() == s[j].length()) {
                if (s[i] > s[j]) {
                    string t = s[i];
                    s[i] = s[j];
                    s[j] = t;
                }

            }
        }
    for (int i = 0; i < n; i++)
        cout << s[i] << endl;
}