[백준 알고리즘] 5543번 상근날드 (Python, Java)

 

<Python>

bur_min = 2000
bev_min = 2000

for i in range(3):
    n = int(input())
    bur_min = min(n, bur_min)

for i in range(2):
    m = int(input())
    bev_min = min(bev_min, m)

print(bur_min + bev_min - 50)

 

<Java>

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int a[] = new int[5];

        for(int i=0; i<5; i++)
            a[i]= Integer.parseInt(br.readLine());

        int min_burger = Math.min(Math.min(a[0],a[1]), a[2]);
        int min_bev = Math.min(a[3], a[4]);

        System.out.println(min_burger + min_bev - 50);

    }
}

 

▼링크

https://www.acmicpc.net/problem/5543

5543번: 상근날드