string processing sorting (Valley 1012 spelling)

There are n positive integers (n≤20), which are joined in a row to form one of the largest multi-bit integers.

For example: n=3, the maximum number of 3 integer 13,312,343 joins is: 34331213

Also such as: n=4, 4 integer 7,13,4,246 joins the largest integer is: 7424613

Input format:

The first line, a positive integer n.

The second line, n positive integers.

Output format:

A positive integer that represents the largest integer

Input Sample # #:

313 312 343

Sample # # of output:

34331213
String water problem, not much explanation.

#include <bits/stdc++.h>using namespace std;string a[2000];int n;bool cmp (const string &a,const string &b) {   return a+b>b+a;} int main () {   cin>>n;   for (int i=1;i<=n;i++)     cin>>a[i];    Sort (a+1,a+n+1,cmp);    for (int i=1;i<=n;i++)      

　　

string processing sorting (Valley 1012 spelling)