[10818] 1차원 배열 - 최소, 최대

문제

 

코드

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        int n;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        int arr[] = new int[n];
        
        for(int i=0; i<n; i++)
            arr[i] = sc.nextInt();
        
        int max=arr[0], min=arr[n-1];
        for(int i=0; i<n-1; i++) {
            if(max<arr[i+1])
                max = arr[i+1];
            if(min>arr[i])
                min = arr[i];
        }
        System.out.println(min + " " + max);
    }
}