1198. Substring

1198. Substring

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

1

3

a

ab

ac

Sample Output

aabac

Problem Source

ZSUACM Team Member

和大多数人第一次WA掉一样,b,ba排序后应该是bab而不是bba.Sort函数里面的自定义函数可以解决.

#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

bool cmp(const string a, const string b)
{
    return a +b < b + a;
}

int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		vector<string>s;
		int n;
		cin>>n;
		string temp;
		while(n--)
		{
			cin>>temp;
			s.push_back(temp);
		}
		sort(s.begin(),s.end(),cmp);
		for(int i=0;i<s.size();i++)
			cout<<s[i];
		cout<<endl;
	}
	return 0;
}