30 . Sorting
Description
Given a set of words, output these words in alphabetic order.
Input Format
There are several test cases. Each test case starts with a number n (1<=n<=100000) denoting the number of words, followed by n words. There are only lower-case letters in the words. The length of a word is at most 10.
Output Format
Output these words for each test case according to the sample output
Sample Input 1
2
de
bee
3
a
aa
aaa
de
bee
3
a
aa
aaa
Sample Output 1
bee->de
a->aa->aaa
a->aa->aaa
Hints
Problem Source
Migrated from old NTUJ.
Subtasks
| No. | Testdata Range | Score |
|---|