Problem A. Bucket sort
Statement
You are to write a program that receives a sequence of words and sorts it in lexicographical order.
Linear order on characters is given by ASCII codes.
Input file format
First line of input file contains integer
N — the sequence length.
Following
N lines contain one word per line.
Each word is exactly three letters long.
Output file format
Output file must consist of
N lines,
each containing one word from sorted sequence.
Constraints
0 ≤ N ≤ 1000000.
Sample tests
| No. |
Input file (input.txt) |
Output file (output.txt) |
|---|
| 1 |
4
KVN
ACM
FSB
GGG
|
ACM
FSB
GGG
KVN
|
