BackPack - Algorythm

import java.util.Scanner;

public class HomeworkBackpack {

    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        System.out.print("PLEASE ENTER THE CAPACITY / KG /: ");
        int m = scan.nextInt();

        System.out.print("PLEASE ENTER THE NUMBER OF OBJECTS (BETWEEN 2 AND 5): ");
        int n = scan.nextInt();

        int [] KG = new int [n];

        for(int i = 0;i < KG.length;i++) {
            System.out.print("PLEASE ENTER THE WEIGHT ( > 2 KG) OF OBJECT " + (i + 1) + ": ");
            KG[i] = scan.nextInt();
        }

        sort(KG);
        backpackCheck(m,KG);
    }

    public static void sort(int [] KG) {

        int element = 0;
        for(int i = 1 ; i < KG.length ; i++) {
            int j = i - 1;
            while(j >= 0 && KG[j] < KG[j + 1]) {
                element = KG[j + 1];
                KG[j + 1] = KG[j];
                KG[j] = element;
                j = j - 1;
            }

        }

    }

    public static void backpackCheck(int m, int [] KG) {

        int [] stat = new int [KG.length];
        int capacityLeft = m;

        for(int i = 0 ; i < KG.length ; i++) {
            stat [i] = capacityLeft / KG[i];
            capacityLeft = capacityLeft - stat [i] * KG[i];

        }
        for(int i = 0 ; i < KG.length; i++) {
            System.out.println("OBJECT " + (i + 1) + " = " + KG[i] + " KG" + " WILL FIT: " + stat [i] + " TIMES");

        }
    }

}