
정렬하면 되는 문제이다.
시간복잡도: O(NLogN), 공간복잡도: O(N)
import java.util.*;
import java.io.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int count = 1;
while(true){
int n = Integer.parseInt(br.readLine());
String [] arr = new String[n];
if(n==0) break;
for(int i=0;i<n;i++){
arr[i] = br.readLine();
}
Arrays.sort(arr);
sb.append(count).append("\n");
for(int i=0;i<n;i++){
sb.append(arr[i]).append("\n");
}
count++;
}
System.out.print(sb);
}
}
