[투포인터] 백준 2230 수고르기

www.acmicpc.net/problem/2230

2230번: 수 고르기

 

 

정렬되어있는 배열으로 진행한다! 

package TwoPointer;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class BOJ_2230 {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		StringTokenizer st = new StringTokenizer(br.readLine());

		int N = Integer.parseInt(st.nextToken());
		int M = Integer.parseInt(st.nextToken());
		int[] arr = new int[N];
		for (int i = 0; i < N; i++) {
			arr[i] = Integer.parseInt(br.readLine());
		}
		Arrays.sort(arr);

		int high = 0, low = 0;
		int cnt = Integer.MAX_VALUE;

		while (high < N && low < N) {
			if (arr[high] - arr[low] < M) {
				high++;
			} else {
				cnt = Math.min(arr[high] - arr[low], cnt);
				low++;
			}
			bw.write("low:" + low +" high:" + high+"\n");
		}
		bw.write(cnt + "\n");
		bw.flush();
		bw.close();
		br.close();
	}

}