[백준] 1337 올바른 배열 - Implementation / Java

• 문제 링크

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

 

• 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        int[] arr = new int[read()];
        for (int i = 0; i < arr.length; i++) arr[i] = read();

        Arrays.sort(arr);
        int i = 0, j = 1, min = 4;
        while (j < arr.length) {
            if (arr[j] - arr[i] > 4) i++;
            else min = Math.min(min, 4 - (j++ - i));
        }

        bw.write(String.valueOf(min));
        bw.flush();
    }

    private static int read() throws IOException {
        int c, n = System.in.read() & 15;
        while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);

        return n;
    }

}