• 문제 링크
https://www.acmicpc.net/problem/6752
• 풀이 코드
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 t = read(), c = read();
int[] arr = new int[c];
while (c-- > 0) arr[c] = read();
Arrays.sort(arr);
while (++c < arr.length && arr[c] <= t) t -= arr[c];
bw.write(String.valueOf(c));
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' 카테고리의 다른 글
[백준] 29865 Kahe käigu ratsu - Graph Theory / Java (0) | 2024.08.15 |
---|---|
[백준] 4363 Snow Clearing - Graph Theory / Java (0) | 2024.08.14 |
[백준] 13472 Sticky Situation - Greedy / Java (0) | 2024.08.12 |
[백준] 23895 Allocation - Greedy / Java (0) | 2024.08.11 |
[백준] 9636 NASSA’s Robot - Greedy / Java (0) | 2024.08.10 |
댓글