PAT-A-1038. Recover the Smallest Number (30)

1038. Recover the Smallest Number (30)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different orders of combinations of these segments, and the smallest number is 0229-321-3214-32-87.

Input Specification:

Each input file contains one test case. Each case gives a positive integer N (<=10000) followed by N number segments. Each segment contains a non-negative integer of no more than 8 digits. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the smallest number in one line. Do not output leading zeros.

Sample Input:

5 32 321 3214 0229 87

Sample Output:

22932132143287

#include<iostream>#include<cstdio>#include<algorithm>#include<string>using namespace std;string s[10010];int cmp(string s1, string s2){  return s1 + s2 < s2 + s1;}int main(){  int n;  cin >> n;  for (int i = 0; i < n; i++)    cin >> s[i];  sort(s, s + n, cmp);    string ans;  for (int i = 0; i < n; i++)    ans += s[i];  while (ans.length() != 0 && ans[0] == '0')    ans.erase(ans.begin());  if (ans.length() == 0)    cout << "0" << endl;  else    cout << ans << endl;  system("pause");  return 0;}