알고리즘 풀이/백준(BOJ)
[JAVA/백준10818] 최소, 최대
닥스훈스
2019. 5. 31. 03:08
문제
소스코드
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static StringTokenizer st;
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
st = new StringTokenizer(br.readLine(), " ");
int[] num = new int[n];
int i = 0;
while (st.hasMoreTokens()) {
num[i] = Integer.parseInt(st.nextToken());
i++;
}
Arrays.sort(num);
System.out.print(num[0] + " " + num[num.length - 1]);
}
}