桶排序60分求助

#include<bits/stdc++.h>
using namespace std;

const int maxn = 3010;

string s[maxn];
int cnt[26];

int main(){
    freopen("dict4.in", "r", stdin);
    freopen("test.out", "w", stdout);
    int n, m;
    cin >> n >> m;
    string mins = "";
    for(int i = 0; i < 3000; i++) mins += "z";
    for(int i = 1; i <= n; i++){
        cin >> s[i];
        if(mins > s[i]) mins = s[i];
    }
    
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < s[i].length(); j++){
            cnt[s[i][j]-'a']++;
        }
        string t = "";
        for(int j = 0; j < 26; j++){//桶排序
            while(cnt[j]){
                t += j+'a';
                cnt[j]--;
            }
        }
       // cout << t << " " << mins << "\n";
        if(t <= mins) cout << 1;//只要比最小的还小或者一样就成立
        else cout << 0;
    }
    return 0;
}