[SWEA] 진기의 최고급 붕어빵

 

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5LsaaqDzYDFAXc

SW Expert Academy

 

 

 

[소스 코드]

import java.util.*;
import java.io.*;
public class Solution {
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			st = new StringTokenizer(br.readLine());
			int n = Integer.parseInt(st.nextToken());
			int m = Integer.parseInt(st.nextToken());
			int k = Integer.parseInt(st.nextToken());
			int[] people = new int[n];
			st = new StringTokenizer(br.readLine());
			for(int i=0;i<n;i++) {
				people[i] = Integer.parseInt(st.nextToken());
			}
			Arrays.sort(people);
			boolean possible = true;
			for(int i=0;i<n;i++) {
				if(people[i]<m) possible = false;
				if(people[i]/m*k-i < 1) possible = false;
			}
			if(!possible) System.out.println("#"+tc+" Impossible");
			else System.out.println("#"+tc+" Possible");
		}
	}
}