[SW expert Academy] SWEA 2063번 중간값 찾기 자바(Java)

[D1] 중간값 찾기 - 2063

문제 링크

성능 요약

메모리: 18,612 KB, 시간: 99 ms, 코드길이: 1,075 Bytes

제출 일자

2023-10-15 15:15

출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SW Expert Academy

 

import java.io.*;
import java.util.*;

class Solution {
    public static void main(String args[]) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int N = Integer.parseInt(br.readLine().trim());

        StringTokenizer st = new StringTokenizer(br.readLine());
        int[] arr = new int[N];
        for (int i = 0; i < N; i++) {
            arr[i] = Integer.parseInt(st.nextToken());
        }

        bubbleSort(arr, N);

        bw.write(arr[N / 2] + "\n");
        bw.flush();
        bw.close();
    }

    private static void bubbleSort(int[] arr, int size) {
        for (int i = 1; i < size; i++) {

            for (int j = 0; j < size - i; j++) {

                if (arr[j] > arr[j + 1]) {
                    swap(arr, j, j + 1);
                }
            }
        }
    }

    private static void swap(int[] arr, int i, int j) {
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }
}