Deep_Lee

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWz5yIfq74QDFARQ&categoryId=AWz5yIfq74QDFARQ&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=11 

 

SW Expert Academy

SW ν”„λ‘œκ·Έλž˜λ° μ—­λŸ‰ 강화에 도움이 λ˜λŠ” λ‹€μ–‘ν•œ ν•™μŠ΅ 컨텐츠λ₯Ό ν™•μΈν•˜μ„Έμš”!

swexpertacademy.com

 


κ΄€λžŒν•˜λŠ” μ‚¬λžŒμ˜ 수 + λΉ„μ›Œμ•Όν•˜λŠ” 자리의 개수 + λΉ„μ›Œμ•Όν•˜λŠ” 자리의 κ°œμˆ˜μ€‘ κ°€μž₯ 큰 수

 

 

 

import java.util.*;

public class Solution {
    public static void main(String[] args) {
        Scanner kb = new Scanner(System.in);
        int T = kb.nextInt();
        for (int t = 1; t <= T; t++) {
            int n=kb.nextInt();
            int[] arr=new int[n];
            int max=0;
            for(int i=0; i<n; i++) {
                arr[i] = kb.nextInt();
                max=Integer.max(max,arr[i]);
            }
            int sum=0;
            for(int i=0; i<n; i++){
                sum+=arr[i];
            }
            sum+=arr.length+max;
            System.out.println("#"+t+" "+sum);
        }
    }