[JAVA] 백준 13300 방 배정

브론즈2 치고는 쬐애끔 엇? 했던 문제.. 물론 난이도는 쉬운편이다. 2차원 배열로 풀어보았당

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class bj13300 {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(in.readLine());
		int N = Integer.parseInt(st.nextToken());
		int K = Integer.parseInt(st.nextToken());

		int[][] count = new int[7][2];
		for (int i = 0; i < N; i++) {
			st = new StringTokenizer(in.readLine());
			int S = Integer.parseInt(st.nextToken()); // 성별
			int Y = Integer.parseInt(st.nextToken()); // 학년

			count[Y][S]++;
		}

		int room = 0;

		for (int i = 1; i < 7; i++) {
			for (int j = 0; j < 2; j++) {
				if (count[i][j] >= K) {
					room = room + (count[i][j] / K);
					if (count[i][j] % K >= 1) {
						room++;
					}
					continue;
				}
				if (count[i][j] == 0) {
					continue;
				} else {
					room++;
				}
			}
		}

		System.out.println(room);

	}
}