31 삐약 : 백준 13300[바킹독 문제 풀이|배열|JAVA]

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

13300번: 방 배정

 

package BKD_0x2_Array;

import java.util.Scanner;

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

        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] g_arr = new int[6];
        int[] b_arr = new int[6];

        for(int i=0;i<N;i++){
            int S = sc.nextInt();
            int Y = sc.nextInt();

            if (S==1) b_arr[Y-1]++;
            else g_arr[Y-1]++;
        }

        int g_room_num = get_max_room_num(g_arr,K);
        int b_room_num = get_max_room_num(b_arr,K);

        System.out.println(g_room_num+b_room_num);



    }

    public static int get_max_room_num(int[] arr, int K){
        int room_count=0;
        for (int grade_num: arr) {
            int quo = grade_num/K;
            int remainder = grade_num % K;

            if(remainder>0) quo++;

            room_count+=quo;
        }
        return room_count;

    }
}