Problem L. Bucket sort
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.
lines contain one word per line.
Each word is exactly three letters long.
Output file format
Output file must consist of N
each containing one word from sorted sequence.
0 ≤ N ≤ 1000000.
||Input file (
|Output file (|