75分求调

#include <bits/stdc++.h>
using namespace std;
bool cmp (string s){
    int a;
    a = s.find('0');
    if (a != -1){
        return true;
    }
    else
        return false;
}
int main() {
    int n;
    cin >> n;
    string arr[n] = {"0"};
    for (int i = 0; i < n; i++)
        cin >> arr[i];
    for (int i = 0; i < n; i++){
        for (int j = i + 1; j < n; j++){
            if (cmp(arr[i]) != cmp(arr[j])){
                if (cmp(arr[i]))
                    if (arr[i].substr(0, arr[i].find('0')) <= arr[j])
                        swap(arr[i], arr[j]);
                    else
                        break;
                else
                    if (arr[j].substr(0, arr[j].find('0')) <= arr[i])
                        break;
                    else
                        swap(arr[i], arr[j]);
            }
            else{
                if (arr[i] < arr[j])
                    swap(arr[i], arr[j]);
            }
        }
    }
    for (int i = 0; i < n; i++)
        cout << arr[i];
	return 0;
}