看90,956这样的串,在比较完之前,就确定大小的,必定选大的放在前。而x=98,y=980;这样的,比较x+y和y+x的大小。如果x+y更小,y就放前。
#include <iostream> #include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <iomanip> #include <cstring> #include <map> #include <queue> #include <set> #include <cassert> #include <stack> #include <bitset> #define mkp make_pair using namespace std; const double EPS=1e-8; typedef long long lon; const lon SZ=330,INF=0x7FFFFFFF,mod=1000000007; void init() { } void work() { } bool cmp(string x,string y) { for(int i=0;i<x.size()&&i<y.size();++i) { if(x[i]<y[i])return 1; else if(x[i]>y[i])return 0; } string s1=x+y,s2=y+x; return s1<s2; } int main() { std::ios::sync_with_stdio(0); //freopen("d:\\1.txt","r",stdin); lon casenum; //cin>>casenum; //cout<<casenum<<endl; //for(lon time=1;time<=casenum;++time) int n; for(int time=1;cin>>n,n;++time) { vector<string> vct(n); for(int i=0;i<n;++i) { cin>>vct[i]; } sort(vct.begin(),vct.end(),cmp); for(int i=vct.size()-1;i>=0;--i)cout<<vct[i]; cout<<endl; } return 0; }