• 문제 링크
https://www.acmicpc.net/problem/8321
• 풀이 코드
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()];
int n = read() * read();
for (int i = 0; i < arr.length; i++) arr[i] = read();
Arrays.sort(arr);
int cnt = 0;
for (int i = arr.length - 1; i >= 0 && n > 0; i--, cnt++) n -= arr[i];
bw.write(String.valueOf(cnt));
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;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 23842 성냥개비 - Brute Force / Java (0) | 2025.04.15 |
---|---|
[백준] 12115 Baza - Brute Force / Java (0) | 2025.04.14 |
[백준] 24855 Natives - Greedy / Java (0) | 2025.04.12 |
[백준] 26511 Complexity - Greedy / Java (0) | 2025.04.11 |
[백준] 30314 Just a Joystick - Greedy / Java (0) | 2025.04.10 |
댓글