摘要： 原题链接稳定排序。附ac代码：#include #include #include using namespace std;int main(){ vector vec; int n, i, j, count = 1, m; string t; while(cin >> n, n){ for(i = 0; i != n; ++i){ cin >> t; vec.push_back(t); } //排序 m = n; while(m > 1){ for(j = 0; j vec[j + 1].length()) t = vec[j], vec[j] = vec... 阅读全文