Notice
Recent Posts
Recent Comments
Link
«   2025/02   »
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28
Tags
more
Archives
Today
Total
관리 메뉴

코드와이

[SW Expert Academy] 7829. 보물왕 태혁 본문

SW_Expert

[SW Expert Academy] 7829. 보물왕 태혁

코드와이 2021. 2. 26. 10:35

 

문제링크

swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=4&contestProbId=AWtInr3auH0DFASy&categoryId=AWtInr3auH0DFASy&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=JAVA&select-1=4&pageSize=10&pageIndex=1

 

SW Expert Academy

SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요!

swexpertacademy.com

 

package D4;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class 보물왕_태혁 {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st;
		
		int T = Integer.parseInt(br.readLine());
		for(int tc = 1; tc <= T ; tc++) {
			sb.append("#").append(tc).append(" ");
			
			int n = Integer.parseInt(br.readLine());
			st = new StringTokenizer(br.readLine());
			
			if(n == 1) {
				int a = Integer.parseInt(st.nextToken());
				sb.append(a*a).append("\n");
				continue;
			}
			int min = 987654321;
			int max = 0;
			for(int i = 0 ; i < n ; i++) {
				int x = Integer.parseInt(st.nextToken());
				min = Math.min(min, x);
				max = Math.max(max, x);
			}
			sb.append(max*min).append("\n");
		}
		sb.setLength(sb.length()-1);
		System.out.println(sb);
	}
}