[SWEA-D3] 1208. Flatten

▶문제설명

[SWEA] 1208. Flatten

https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV139KOaABgCFAYh&categoryId=AV139KOaABgCFAYh&categoryType=CODE

▶Solution

---

import java.util.*;
 
class Solution{
    public static int[] BoxArr = new int[100];
    public static int DumpNum = 0;
    public static int val = -1;
    
     public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        
        for(int T = 1 ; T<=10 ; T++){
            DumpNum = sc.nextInt();
            for(int i = 0 ; i<100 ; i++){
                BoxArr[i] = sc.nextInt();
            }
            
            for(int i = 0 ; i<DumpNum ; i++){
                Arrays.sort(BoxArr);
                val = BoxArr[BoxArr.length-1] - BoxArr[0];
                if( val == 0 || val == 1 ) 
                    break;
                
                BoxArr[BoxArr.length-1] -= 1;
                BoxArr[0] += 1;
            }
            Arrays.sort(BoxArr);
            val = BoxArr[BoxArr.length-1] - BoxArr[0];
            
            System.out.printf("#%d %d\n", T, val);
        }
    }
}