传送门

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
long long n;
string s;
struct abc {
	string space;
} a[10005];
int main() {
	cin >> n;
	int num = 1;
	for(int i=1; i<=n; i++) {
		cin>>a[i].space;
	}
	for(int i=1; i<=n-1; i++) {
		for(int j=1; j<=n-i+1; j++) {
			if(a[j+1].space.size()>a[j].space.size()||a[j+1].space>a[j].space&&a[j+1].space.size()>=a[j].space.size()) { 
				s=a[j].space;
				a[j].space=a[j+1].space;
				a[j+1].space=s;
			}
		}
	}
	for(int i=n; i>=1; i--) {
		cout<<a[i].space<<" ";
	}
	return 0;
}

8个测试点WA了最后3个,求大佬帮忙

《真正的蒟蒻》