[D1] Title: 중간값 찾기, Time: 75 ms, Memory: 25,216 KB -BaekjoonHub

Author: SHIMHUN

SWEA/D1/2063. 중간값 찾기/README.md

@@ -0,0 +1,15 @@
+# [D1] 중간값 찾기 - 2063 
+
+[문제 링크](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5QPsXKA2UDFAUq) 
+
+### 성능 요약
+
+메모리: 25,216 KB, 시간: 75 ms, 코드길이: 543 Bytes
+
+### 제출 일자
+
+2025-09-25 16:32
+
+
+
+> 출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SWEA/D1/2063. 중간값 찾기/중간값 찾기.java

@@ -0,0 +1,20 @@
+import java.io.*;
+import java.util.*;
+
+class Solution
+{
+	public static void main(String args[]) throws Exception
+	{
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int N = Integer.parseInt(br.readLine());
+        int[] arr = new int[N];
+        
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for(int i=0; i<N; i++){
+            int score = Integer.parseInt(st.nextToken());
+            arr[i] = score;
+        }
+        Arrays.sort(arr);
+        System.out.println(arr[N/2]);
+	}
+}