[백준][JAVA] 2230번 수 고르기

2230번: 수 고르기

코드

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));
		StringTokenizer st = new StringTokenizer(br.readLine());
		
		int N = Integer.parseInt(st.nextToken());
		int M = Integer.parseInt(st.nextToken());
		
		int[] A = new int[N];
		
		for (int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(br.readLine());
		}
		
		int answer = 2000000000;
		Arrays.sort(A);
		int right = 0;
		
		for (int left = 0; left < N; left++) {
			while (right < N) {
				int diff = A[right] - A[left];
				if (diff < M) {
					right++;
				} else {
					answer = Math.min(answer, diff);
					break;
				}
			}
		}
		
		System.out.println(answer);
	}

}