BOJ 2108 통계학

1 개요

BOJ 2108 통계학

• 백준 온라인 저지 2108번 문제
• [[BOJ {{{단계}}}단계]]

[[분류:BOJ {{{단계}}}단계]]

2 Java

import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
	public static void main(String args[]) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int size = Integer.parseInt(br.readLine());
		int arr[] = new int[size];
		int counts[] = new int[8001];
		int n, sum=0, min=4000, max=-4000;
		for(int i=0; i<size; i++) {
			n = Integer.parseInt(br.readLine());
			arr[i] = n;
			sum += n;
			counts[4000+n]++;
			if( n>max ) max=n;
			if( n<min ) min=n;
		}
		int max_count = 0;
		for(int i=min; i<=max; i++) {
			if( counts[4000+i]>max_count ) max_count = counts[4000+i];
		}
		int max_item_count = 0;
		for(int i=min; i<=max; i++) {
			if( counts[4000+i]==max_count ) max_item_count++;
		}
		int target_count = 0;
		int freq = 0;
		for(int i=min; i<=max; i++) {
			if( counts[4000+i]==max_count ) {
				target_count++;
				if( target_count == max_item_count || target_count == 2 ) {
					freq = i;
					break;
				}
			}
		}
		Arrays.sort(arr);
		System.out.println( Math.round(1.0D*sum/size) );
		System.out.println( arr[size/2] );
		System.out.println( freq );
		System.out.println( max-min );   
	}
}