Java - 백준 코딩테스트 10818번 [1차원 배열 - 최소, 최대]

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
 
public class MinMax {
 
    public static void main(String[] args) throws IOException {
        // 20210621 - 10818번
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        
        int num = Integer.parseInt(br.readLine());
        
        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        
        int arr[] = new int[num];
        
        for (int i = 0; i < arr.length; i++) {
            arr[i] = Integer.parseInt(st.nextToken());
        }
        
        Arrays.sort(arr);
        
        bw.write(String.valueOf(arr[0]) + " ");
        bw.append(String.valueOf(arr[num - 1]));
        
        bw.flush();
        bw.close();
        br.close();
    }
}