№3Минимальное поло

public class Main {
    public static void main(String[] args) {
        int[] num = new int[]{1, 3, 2, 4, 5};
        num = sort(num);
        int count = 0;
        int counter = 0;
        for(int n:num){
            System.out.print(n);
        }
        System.out.println();
        for (int n: num) {
            for (int i = 0; i < num.length; i++) {
                int tmp = n;
                if (mod(tmp, num[i])) {
                    counter++;
                    count = count+num[n];
                    break;
                }
                if(counter>3){
                    break;
                }
            }
        }
        System.out.print(count);
    }

    public static boolean mod(int b, int a) {
        return b % a == 0;
    }

    public static int [] sort  (int [] numberMas){
        int tmp;
        for(int j = 0; j<numberMas.length; j++) {
            for (int i = 0; i < numberMas.length; i++) {
                if (numberMas[j] < numberMas[i]) {
                    tmp = numberMas[j];
                    numberMas[j] = numberMas[i];
                    numberMas[i] = tmp;
                }
            }
        }
        return numberMas;
    }
}