Children's Game uva 10905

There are lots of number games for children. These games are pretty easy to play but not so easy to make. We will discuss about an interesting game here. Each player will be given N positive integer. (S)He can make a big integer by appending those integers after one another. Such as if there are 4 integers as 123, 124, 56, 90 then the following integers can be made — 1231245690, 1241235690, 5612312490, 9012312456, 9056124123, etc. In fact 24 such integers can be made. But one thing is sure that 9056124123 is the largest possible integer which can be made. You may think that it’s very easy to find out the answer but will it be easy for a child who has just got the idea of number?

Input

Each input starts with a positive integer N (≤ 50). In next lines there are N positive integers. Input is terminated by N = 0, which should not be processed.

Output

For each input set, you have to print the largest possible integer which can be made by appending all the N integers.

Sample Input

4

123 124 56 90

5

123 124 56 90 9

5

9 9 9 9 9

0

Sample Output

9056124123

99056124123

99999

题意 & 思路：题目很水，将 n 个数拼成一个能拼的最大整数，但是不知道为啥，不管是用两个数模拟，还是自己手写字符串挨个模拟都会WA，用String却莫名过了？

#include<iostream>
 #include<map>
  #include<vector>
   #include<cstdio>
    #include<algorithm>
 using namespace std;
  typedef long long ll;
   typedef vector<ll> vl;
    typedef vector<int> vi;
     typedef vector<string> vs;
     typedef pair<int,int> pii;
      typedef pair<int,ll> pil;
       typedef pair<ll,int> pli;
        typedef pair<ll,ll> pll;
bool cmp(string a , string b){
   return a + b > b + a;
}
  int main(){      std::ios::sync_with_stdio(false);
            int n;
             vector<string> ans;
          while(cin >> n && n){   vs a;for(int i = 0 ; i < n ; ++ i){string k;cin >> k;a.push_back(k);}
              sort(a.begin(),a.end(),cmp);
              for(string i : a) cout << i;
              cout << endl;
          }
       }