Rokua P1012 spell Label: Continuation of the life simulation Qaq

Title Description

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/output format

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 and Output Sample input example # #:

313 312 343

Sample # # of output:

34331213

Code

1#include <iostream>2#include <cstring>3#include <algorithm>4#include <cstdio>5 using namespacestd;6 intN;7 stringa[ at];8 9 BOOLcmpstringXstringy) {Ten      for(intI=0; I<min (X.size (), y.size ()); i++){ One         if(X[i]<y[i])return 0; A         Else if(X[i]>y[i])return 1; -     } -     if(X.size () >y.size ())returnX[x.size ()-1]<y[0]; the     Else returnx[0]>y[y.size ()-1]; - } - intMain () { - //freopen ("01.in", "R", stdin); +      -Cin>>N; +      for(intI=0; i<n;i++) cin>>A[i]; ASort (a,a+n,cmp); at      for(intI=0; i<n;i++) cout<<A[i]; -      -      -     return 0; -}

Comparison function is very peculiar, before only 75 WA here, when the two string prefix is the same when the longer and the short place in the same position when the big

In fact, the above code comparison method is wrong, the solution is right, the code is the key to pay attention to the defect!!!

Rokua P1012 spell Label: Continuation of the life simulation Qaq