问题类型：STL-Sort
03pie’s solution for [UVA-10905]: 问题链接
#include<iostream>
#include<cstring>
#include<algorithm
using namespace std;
const int maxn=
50+
5;
string ans[maxn];
bool cmp(
string a,
string b){
return a+b>b+a;
}
int main(){
int n;
while(cin>>n&&n){
for(
int i=
0;i<n;i++){ cin>>ans[i]; }
sort(ans,ans+n,cmp);
for(
int i=
0;i<n;i++){ cout<<ans[i];}
cout<<endl;
}
return 0;
}
转载请注明原文地址: https://ju.6miu.com/read-667216.html
