字符串排序怎么卡过了

#include <bits/stdc++.h>
using namespace std;
string sp[3010];
string sq[3010];
bool cmp(char const& x, char const& y) {
    return x > y;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n, m;
    cin >> n >> m;
    if (n == 1) {
        cout << "1\n";
        return 0;
    }
    string s, ts;
    for (int i = 1; i <= n; i++) {
        cin >> s;
        ts = s;
        sort(ts.begin(), ts.end());
        sp[i] = ts;
        sort(s.begin(), s.end(), cmp);
        sq[i] = s;
    }
    for (int i = 1; i <= n; i++) {
        int j = 1;
        while (j <= n) {
            if (j == i or sp[i] < sq[j]) j++;
            else break;
        }
        if (j == n + 1) cout << 1;
        else cout << 0;
    }
    return 0;
}