2026.03.14

오늘도 일 끝나고 급하게 푸느냐고 쉬운 문제...

ProjectTeams_20044

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

public class ProjectTeams_20044 {
    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 n = Integer.parseInt(br.readLine());
        StringTokenizer st = new StringTokenizer(br.readLine());

        int[] arr = new int[2 * n];
        for (int i = 0; i < 2 * n; i++) {
            arr[i] = Integer.parseInt(st.nextToken());
        }

        Arrays.sort(arr);

        int minResult = Integer.MAX_VALUE;

        for (int i = 0; i < n; i++) {
            int result = arr[i] + arr[(2 * n) - 1 - i];

            minResult = Math.min(minResult, result);
        }

        bw.write(minResult + "\n");
        bw.flush();
        bw.close();
    }
}

보자마자 정렬해서 좌우로 팀 정하면 풀릴거같더라 ㅎㅎ