[Baekjoon] 5543 - 상근날드

📝 문제

 

 

🔓 답안

① 배열 + Arrays.sort()를 사용한 답안

import java.io.*;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int[] burger = new int[3];
        int[] drink = new int[2];

        for(int i = 0; i < 3; i++){
            burger[i] = Integer.parseInt(br.readLine());
        }
        for(int i = 0; i < 2; i++){
            drink[i] = Integer.parseInt(br.readLine());
        }

        Arrays.sort(burger);
        Arrays.sort(drink);

        bw.write(String.valueOf(burger[0] + drink[0] - 50) + "\n");
        bw.flush();
        bw.close();
    }

}

② for문을 사용해서 버거, 음료의 최솟값을 구한 답안

import java.io.*;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int burger = 2001;
        int drink = 2001;

        for(int i = 0; i < 3; i++){
            int n = Integer.parseInt(br.readLine());

            if(n < burger)
                burger = n;
        }
        for(int i = 0; i < 2; i++){
            int n = Integer.parseInt(br.readLine());

            if(n < drink)
                drink = n;
        }


        bw.write(String.valueOf(burger + drink - 50) + "\n");
        bw.flush();
        bw.close();
    }

}

 

 

 

🖤 알고리즘 분류

- 수학

- 사칙연산