본문 바로가기
Algorithms/SW expert

[Java] 1285. 아름이의 돌 던지기

by kyungsubbb 2021. 3. 25.

swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV18-stqI8oCFAZN&categoryId=AV18-stqI8oCFAZN&categoryType=CODE&problemTitle=1285&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1

 

SW Expert Academy

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

swexpertacademy.com


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

public class SWEA_1285 {

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(in.readLine());
		for (int tc = 1; tc <= T; tc++) {
			int n = Integer.parseInt(in.readLine());
			int arr[] = new int[n];
			StringTokenizer st = new StringTokenizer(in.readLine(), " ");
			for (int i = 0; i < arr.length; i++) {
				arr[i] = Math.abs(Integer.parseInt(st.nextToken()));
			}
			int min = Integer.MAX_VALUE;
			for (int i = 0; i < arr.length; i++) {
				if (arr[i] < min) {
					min = arr[i];
				}
			}
			int cnt = 0;
			for (int i = 0; i < arr.length; i++) {
				if (min == arr[i])
					cnt++;
			}
			System.out.println("#" + tc + " " + min + " " + cnt);
		}
	}

}