일곱 난쟁이

 

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

2309번: 일곱 난쟁이

 

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int sum = 0;
        int n = 9;
        int[] arr = new int[n];
        boolean found = false;

        for (int i = 0; i < n; i++) {
            int temp = sc.nextInt();
            arr[i] = temp;
            sum += temp;
        }

        Arrays.sort(arr);

        for (int i = 0; i < 9; i++) {
            if (found) break;
            for (int j = i+1; j < 9; j++) {
                if (sum - arr[i] - arr[j] == 100) {
                    found = true;
                    arr[i] = -1;
                    arr[j] = -1;
                }
            }
        }

        for (int i = 0; i < 9; i++) {
            if(arr[i] != -1) {
                System.out.println(arr[i]);
            }
        }
    }
}