[SWEA] Flatten

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

SW Expert Academy

 

class Solution
{
	public static void main(String args[]) throws Exception
	{
		Scanner sc = new Scanner(System.in);
		int T;
		T=10;

		for(int test_case = 1; test_case <= T; test_case++)
		{
			int dump = sc.nextInt();
            int[] height = new int[100];

            for(int i=0; i<100; i++){
                height[i] = sc.nextInt();
            }
            for(int j=0; j<dump; j++){
                   int max =0;
                   int min =101;
                   int maxIndex = -1;
                   int minIndex = 101;
                for(int k=0; k<100; k++){
                if(height[k] >= max){                   
                    max = height[k];
                    maxIndex = k;                   
               	 }
                if(height[k]<=min){
                    min = height[k];
                    minIndex = k;               
                }                   
          	  }
                height[maxIndex] = height[maxIndex] -1;
                height[minIndex] = height[minIndex] +1;
			}
            int lastMax = 0;
            int lastMin = 101;
            for(int l=0; l<100; l++){
                if(lastMax <= height[l])
                    lastMax = height[l];
                if(lastMin >= height[l])
                    lastMin = height[l];
            }
            System.out.println("#" + test_case + " " + (lastMax-lastMin));
		}
	}
}

 

단순하다. 최대최소 찾기 반복, 차이 경감, 다시 마지막으로 찾아서 차이 출력하기