• 문제 링크
https://www.acmicpc.net/problem/21557
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int n = read() - 2, a = read(), b;
        for (int i = 0; i < n; i++) read();
        b = read();
        while (n-- > 1) {
            if (a > b) a--;
            else b--;
        }
        bw.write(String.valueOf(Math.max(a, b) - 1));
        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' 카테고리의 다른 글
| [백준] 2545 팬케익 먹기 - Greedy / Java (0) | 2024.06.14 | 
|---|---|
| [백준] 6123 O Those Fads - Greedy / Java (0) | 2024.06.13 | 
| [백준] 26552 Zero - Greedy / Java (0) | 2024.06.11 | 
| [백준] 14916 거스름돈 - Greedy / Java (0) | 2024.06.10 | 
| [백준] 23854 The Battle of Giants - Greedy / Java (0) | 2024.06.09 | 
 
										
									 
										
									 
										
									 
										
									
댓글