【华为OJ】【014-字串的连接最长路径查找】
题目链接:
https://blog.csdn.net/DERRANTCM/article/details/51319745
C++实现:
void main()
{
int n1,n2,n3,n4;
string str1,strOut;
vector<string> strIn;
cin >> n1;
while(n1--)
{
cin >> str1;
strIn.push_back(str1);
}
sort(strIn.begin(),strIn.end());
for (int i=0;i<strIn.size();i++)
cout << strIn[i] << endl;
system("pause");
}