[백준] 10818 최소, 최대

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

10818번: 최소, 최대

 

방법1

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
		sc.nextLine();
		
		for(int i=0; i<n; i++) {
			arr[i] = sc.nextInt();
		}
		
		Arrays.sort(arr);

		System.out.println(arr[0] + " " + arr[n-1]);
		sc.close();
	}
}