백준 2108번

원본 : www.acmicpc.net/problem/2108

2108번: 통계학

 

풀이

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;

public class Main {

	public static void main(String[] args) throws Exception {

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
		
		int n = Integer.parseInt(reader.readLine());
        int input[] = new int[n];
        int sum = 0;
        int count[] = new int[8001];
        
        for (int i = 0; i < input.length; i++) {
            input[i] = Integer.parseInt(reader.readLine());
            sum += input[i];
            if (input[i] < 0) {
                int idx = 4000 + Math.abs(input[i]);
                count[idx]++;
            } else {
                count[input[i]]++;
            }
        }
        
        Arrays.sort(input);
        
        int maxCount = count[0];
        for (int i = 1; i < count.length; i++) {
            if (maxCount < count[i]) {
                maxCount = count[i];
            }
        }
        
        ArrayList<Integer> list = new ArrayList<Integer>();
        
        for (int i = 0; i < count.length; i++) {
            if (maxCount == count[i]) {
                if (i > 4000) {
                    list.add((i - 4000) * -1);
                } else {
                    list.add(i);
                }
            }
        }
        list.sort(null);
        
        writer.write((int)Math.round((double)sum / (double)n) + "\n");
        writer.write(input[(int)Math.ceil(input.length / 2)] + "\n");
        if (list.size() >= 2) {
            writer.write(list.get(1) + "\n");
        } else {
            writer.write(list.get(0) + "\n");
        }
        writer.write(input[n - 1] - input[0] + "\n");
        
		writer.flush();
    }
    
}