[SW Expert Academy] 코딩 토너먼트1 (D3)

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

SW Expert Academy

 

 

queue 사용

import java.util.ArrayDeque;
import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		
		for(int tc=1;tc<=t;tc++) {
			
			int k = sc.nextInt();
			
			int sum=0;
			
			ArrayDeque<Integer> q = new ArrayDeque<>();
			
			for(int i=0;i<Math.pow(2, k);i++) {
				q.add(sc.nextInt());
			}
			
			while(q.size()>=2) {
				
				int a = q.poll();
				int b = q.poll();
				
				sum+=Math.abs(a-b);
				q.add(Math.max(a, b));
					
			}
			
			System.out.println("#"+tc+" "+sum);
			
			
		}
		
		
	}
}

 

 

array (배열) 사용

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {

			int k = (int) Math.pow(2, sc.nextInt());

			int arr[] = new int[k];

			for (int i = 0; i < k; i++) {
				arr[i] = sc.nextInt();
			}

			int sum = 0;

			while (k > 0) {

				for (int i = 0; i < k / 2; i++) {

					int a = arr[i * 2];
					int b = arr[i * 2 + 1];

					sum += Math.abs(a - b);

					arr[i] = Math.max(a, b);
				}

				k /= 2;
			}

			System.out.println("#" + tc + " " + sum);

		}

	}
}