[D1] Title: 최대수 구하기, Time: 76 ms, Memory: 25,088 KB -BaekjoonHub

Author: SHIMHUN

SWEA/D1/2068. 최대수 구하기/README.md

@@ -0,0 +1,15 @@
+# [D1] 최대수 구하기 - 2068 
+
+[문제 링크](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5QQhbqA4QDFAUq) 
+
+### 성능 요약
+
+메모리: 25,088 KB, 시간: 76 ms, 코드길이: 700 Bytes
+
+### 제출 일자
+
+2025-09-24 18:08
+
+
+
+> 출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SWEA/D1/2068. 최대수 구하기/최대수 구하기.java

@@ -0,0 +1,24 @@
+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 T = Integer.parseInt(br.readLine());
+        StringBuilder sb = new StringBuilder();
+        
+        for(int i=1; i<=T; i++){
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int max = Integer.MIN_VALUE;
+            for(int j=0; j<10; j++){
+                int num = Integer.parseInt(st.nextToken());
+                if(max<num) max = num;
+            }
+            sb.append("#" + i + " " + max).append("\n");
+		}
+        
+        System.out.println(sb);
+    }
+}