O(n^2)這道題不能夠直接排序，比如3和23，但是233比323大，所以采用兩兩組合再進(jìn)行比較，字符串會(huì)自行按照字典序比較。var n,i,j,x:longint; s:array[0..233] of string;begin readln(n); for i:=1 to n do begin read(x); str(x,s[i]); end; for i:=1 to n-1 do for j:=i+1 to n do if s[i]+s[j]<s[j]+s[i] then begin s[0]:=s[i]; s[i]:=s[j]; s[j]:=s[0]; end; for i:=1 to n do write(s[i]);end.
