매일 Algorithm

백준 2582번 (구현)

import java.util.Scanner;

public class problem266 {

    public static void main(String[] args) {


        Scanner in = new Scanner(System.in);
        int[] arr = new int[1001]; // 입력값은 1000보다 작은 수
        int a = 0;
        for (int i = 0; i < 10; i++) {
            int n = in.nextInt();
            a += n;
            arr[n]++; // index 값 증가
        }

        int max = 0;
        int result = 0;
        for (int i = 0; i < 1001; i++) {
            if (arr[i] > max) {
                max = arr[i];
                result = i; // 값 바인딩
            }
        }

        System.out.println(a / 10);
        System.out.println(result);
    }
}

백준 11943번 (구현)

import java.util.Scanner;

public class problem267 {

    public static void main(String[] args) {

        // 간단한 구현문제다
        Scanner in = new Scanner(System.in);

        int a = in.nextInt();
        int b = in.nextInt();
        int c = in.nextInt();
        int d = in.nextInt();


        System.out.println(Math.min(a + d, b + c));

    }
}