코딩테스트/자바 문제풀이

[CLASS 1: 구현] 백준 10818 최소, 최대

승요나라 2024. 10. 2. 01:14

10818번: 최소, 최대

https://www.acmicpc.net/problem/10818

 

# 코드

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        long[] arr = new long[n];
        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        for (int i = 0; i < n; i++) {
            arr[i] = Long.parseLong(st.nextToken());
        }
        Arrays.sort(arr);
        System.out.println(arr[0] + " " + arr[n-1]);
        br.close();
    }
}