JAVA 알고리즘
SWEA 2063 중간값 찾기
잡다한 저장소
2020. 1. 18. 00:47
import java.util.Scanner;
import java.util.Arrays;
class Solution {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int nums[] = new int[N];
for(int i=0; i<N; i++) nums[i] = sc.nextInt();
Arrays.sort(nums);
System.out.println( nums[(N-1)/2] );
}
}