sicily 1198. Substring

1198. Substring

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

Dr lee cuts a string S into N pieces,s[1],…,s[N].   

Now, Dr lee gives you these N sub-strings: s[1],…s[N]. There might be several possibilities that the string S could be. For example, if Dr. lee gives you three sub-strings {“a”,“ab”,”ac”}, the string S could be “aabac”,”aacab”,”abaac”,…   

Your task is to output the lexicographically smallest S. 

Input

        The first line of the input is a positive integer T. T is the number of the test cases followed.   

The first line of each test case is a positive integer N (1 <=N<= 8 ) which represents the number of sub-strings. After that, N lines followed. The i-th line is the i-th sub-string s[i]. Assume that the length of each sub-string is positive and less than 100. 

Output

The output of each test is the lexicographically smallest S. No redundant spaces are needed. 

Sample Input

13aabac

Sample Output

aabac

Problem Source

ZSUACM Team Member

#include<algorithm> #include<string> using namespace std; // 2个字符串组合，比较a+b和b+a的大小即可。 // 同理n个字符串，只需每两个都比较一次。 // 枚举 8！ 可解 bool cmp(string a, string b) { if (a + b < b + a) { return true; } else { return false; } } int main() { int t; cin >> t; string str[8]; while (t--) { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> str[i]; } sort(str, str + n, cmp); for (int i = 0; i < n; i++) { cout << str[i]; } cout << endl; } return 0; } </string></algorithm>