[SWEA/Java] 2068. 최대수 구하기(D1)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=1&contestProbId=AV5QQhbqA4QDFAUq&categoryId=AV5QQhbqA4QDFAUq&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=JAVA&select-1=1&pageSize=10&pageIndex=1 

SW Expert Academy

---

문제 설명

 

풀이 코드(Java)

import java.util.Arrays;
import java.util.Scanner;
 
public class Solution {
    public static void main(String[] args) throws Exception {
 
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
 
        for (int i = 1; i <= t; i++) {
            int[] num = new int[10];
 
            for (int j = 0; j < 10; j++) {
                num[j] = sc.nextInt();
            }
            Arrays.sort(num);
            System.out.printf("#%d %d\n", i, num[9]);
        }
    }
}