import java.util.ArrayList;
import java.util.Arrays;
public class Dustearray {
    public static void main(String[] args){
        final int[] array = new int[300];
        ArrayList<Integer> krukke = new ArrayList<Integer>();
        int sum = 0, nærmest = 0;
        for (int i = 100; i <= 1000; i++)
            krukke.add(i);
        for(int i = 0; i < array.length; i++)
            array[i] = krukke.remove((int)(Math.random()*krukke.size()));
        Arrays.sort(array);
        for(int i = 0; i < array.length ; i++)
            sum = sum + array[i];
        for(int i = 0; i < array.length ; i++)
            if(Math.abs((double)array[i] - sum/array.length) < Math.abs((double)nærmest - sum/array.length))
                nærmest = array[i];
        System.out.println("Minst: " + array[0] +", størst: " + array[array.length-1] + ", snitt: " + (sum/array.length) +", nærmest: " + nærmest );
    }
}