"P1012", "The Test of the Valley" "Simulation Project"

"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 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

"Output Sample # #"
34331213

The idea:water problem.
Storing with stringsa custom sort fix: Two strings in the positive side and upside down to choose the big oneKey Code

1 int cmp (string A,string  b)2{3     return a+b>b+A; 4 }

1#include <iostream>2#include <algorithm>3#include <cstring>4 using namespacestd;5 intcmpstringAstringb)6 {7     returna+b>b+A;8 }9 intMain ()Ten { One     intN; ACin>>N;  -     stringa[ -]; -      for(intI=0; i<n;i++) cin>>A[i]; theSort (a,a+n,cmp); -      for(intI=0; i<n;i++) cout<<A[i]; -     return 0; -}

View full Code

At 2016-08-12 22:12:26 Remember

"P1012", "The Test of the Valley" "Simulation Project"