[SW Expert Academy] 진기의 최고급 붕어빵 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV5LsaaqDzYDFAXc&categoryId=AV5LsaaqDzYDFAXc&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=12

SW Expert Academy

 

방법 1

import java.util.Arrays;
import java.util.Scanner;
 
class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
 
        for (int tc = 1; tc <= t; tc++) {
 
            int n = sc.nextInt();
            int m = sc.nextInt();
            int k = sc.nextInt();
 
            int currentTime = 0;
            int bread = 0;
 
            int arr[] = new int[n];
 
            for (int i = 0; i < n; i++) {
                arr[i] = sc.nextInt();
            }
 
            Arrays.sort(arr);
 
            for (int i = 0; i < n; i++) {
                int person = arr[i];
                // System.out.println("person:"+person);
                while (person > currentTime) {
                    currentTime++;
                    if (currentTime % m == 0) {
                        bread += k;
                        // System.out.println("bread:"+bread);
                    }
                }
                bread -= 1;
 
                // System.out.println("bread:"+bread);
 
                if (bread == -1) {
                    break;
                }
            }
 
            if (bread == -1) {
                System.out.println("#" + tc + " " + "Impossible");
            } else {
                System.out.println("#" + tc + " " + "Possible");
            }
 
        }
 
    }
}

 

방법 2

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

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

		for (int tc = 1; tc <= t; tc++) {

			int n = sc.nextInt();
			int m = sc.nextInt();
			int k = sc.nextInt();

			boolean isPossible=true;

			int arr[] = new int[n];

			for (int i = 0; i < n; i++) {
				arr[i] = sc.nextInt();
			}

			Arrays.sort(arr);

			for (int i = 0; i < n; i++) {
				
				if(arr[i]/m*k-i<1) { //현재 사람까지 만들어진 붕어빵-앞 사람 붕어
					isPossible=false;
					break;
				}
				
			}
			
			if(isPossible) {
				System.out.println("#"+tc+" "+"Possible");
			}
			else {
				System.out.println("#"+tc+" "+"Impossible");
			}

		

		}

	}
}