[알고리즘] 백준 2309 JAVA

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
  
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  
    int[] arr = new int[9];
    int sum = 0;
    for (int i = 0; i < 9; i++) {
      StringTokenizer st = new StringTokenizer(br.readLine());
      arr[i] = Integer.parseInt(st.nextToken());
      sum += arr[i];
    }
    for (int i = 0; i < 8; i++) {
      for (int j = i + 1; j < 9; j++) {
        if (sum - arr[i] - arr[j] == 100) {
          arr[i] = 0;
          arr[j] = 0;
          Arrays.sort(arr);
          for (int k = 2; k < 9; k++) {
            System.out.println(arr[k]);
          }
          return;
        }
      }
    }
  }
}