思路:
- 很神奇的题,将元素看做字符串再排个序竟然就过了!
- 不过要注意在cmp中不能直接比较a,b串,因为string的比较会受长度的影响,而要想数更大则必须大数字靠前。
代码实现:
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int n;
string s[30];
int cmp(string a, string b){
return a + b > b + a;
}
signed main()
{
IOS;
cin >> n;
for(int i = 0; i < n; i ++) cin >> s[i];
sort(s, s + n, cmp);
for(int i = 0; i < n; i ++) cout << s[i];
cout << endl;
return 0;
}