[SWEA][JAVA]D3 : Flatten

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

SW Expert Academy

 

---

문제설명은 긴데 그냥 정렬 문제이다.

100개를 담은 배열을, 평탄화할 횟수만큼 [정렬] - 최대값은 -1 - 최소값은 +1 반복해주고

평탄화가 끝나고 최대값 - 최소값이 정답

 

 

 

import java.util.Scanner;
import java.util.Arrays;
class Solution{
    public static void main(String args[]) throws Exception{
        Scanner kb = new Scanner(System.in);
        int t = 10;
        for (int test_case = 1; test_case <= t; test_case++) {
            int n = kb.nextInt(); // 덤프 횟수
            int[] arr=new int[100];
            for(int i=0; i<100; i++){
                arr[i]=kb.nextInt();
            }
            int max=0;
            int min=0;
            for(int i=0; i<n; i++){
                Arrays.sort(arr);
                max=arr[99]--;
                min=arr[0]++;
            }
            Arrays.sort(arr);
            max=arr[99];
            min=arr[0];
            System.out.println("#"+test_case+" "+(max-min));

        }
    }
}