BOJ2230 수 고르기

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

2230번: 수 고르기

 

import java.util.*;
import java.io.*;
public class Main
{
    
    public static int search(int[] numbers, int m){
        int right = 0;
        int min_diff = 2_000_000_000; 
        for(int left=0; left<numbers.length; left++){
            int diff = numbers[right]-numbers[left];
            while(diff<m && right+1<numbers.length){
                right+=1;
                diff = numbers[right]-numbers[left];
                
            }
            if(diff>=m){
                min_diff = Math.min(min_diff, diff);
                // System.out.println(left+" "+right+" "+min_diff);
            }
        }
        return min_diff;
        
    }
	public static void main(String[] args) throws IOException{
	    // 입력
	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	    String[] input1 = br.readLine().split(" ");
	    int n = Integer.valueOf(input1[0]);
	    int m = Integer.valueOf(input1[1]);
	    int[] numbers = new int[n];
	    for(int i=0; i<n; i++){
	        numbers[i] = Integer.parseInt(br.readLine());
	    }
	    
        Arrays.sort(numbers);
        
        //답 구하기
        int ans = search(numbers, m);
        System.out.println(ans);
	}
}

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

class Main
{
    public static void main (String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] arr = new int[N];
        for (int i = 0; i < N; i++)
            arr[i] = sc.nextInt();

        Arrays.sort(arr);
        
        int ansDiff = arr[N - 1] - arr[0];
        int rightIndex = 0;
        for (int leftIndex = 0; leftIndex < N; leftIndex++) {
            while (arr[rightIndex] - arr[leftIndex] < M && rightIndex < N - 1)
                rightIndex++;
            int diff = arr[rightIndex] - arr[leftIndex];
            if (diff >= M) ansDiff = Math.min(ansDiff, diff);
        }
        System.out.println(ansDiff);
    }
}