Sung's Placement Test

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner in  = new Scanner(System.in);
        int T = in.nextInt(); //the number of test cases
        for(int tc = 1; tc <= T; tc++) {
            int N = in.nextInt(); // the number of the students
            int Kmin = in.nextInt();
            int Kmax = in.nextInt();
            int[] scores = new int[1001];
            int Smin = 100; //the min score
            int Smax = 1;   //the max score
            for(int i = 0; i < N; i++) {
                scores[i] = in.nextInt();
                if(scores[i] > Smax) {
                    Smax = scores[i];
                }
                if(scores[i] < Smin) {
                    Smin = scores[i];
                }
            }
            int result = 1000;
            for(int T1 = Smin; T1 < Smax; T1++) {
                for(int T2 = Smax; T2 > Smin; T2--) {
                    int[] nums = new int[3]; //the numbers of Class A, B, C
                    boolean flag = true;
                    for(int j = 0; j < N; j++) {
                        if(scores[j] >= T2) {
                            nums[0]++;  //the num of Class A
                            if(nums[0] > Kmax) {
                                flag = false;
                                break;
                            }
                        }else if(scores[j] < T1) {
                            nums[2]++;  //the num of Class C
                            if(nums[2] > Kmax) {
                                flag = false;
                                break;
                            }
                        }else {
                            nums[1]++;
                            if(nums[1] > Kmax) {
                                flag = false;
                                break;
                            }
                        }
                    }
                    for(int x = 0; x < 3; x++) {
                        if(nums[x] < Kmin) {
                            flag = false;
                        }
                    }
                    if(flag) {
                        sort(nums);
                        int temp = nums[2] - nums[0];
                        if(temp < result) {
                            result = temp;
                        }
                    }
                }
            }
            if(result == 1000) {
                result = -1;
            }
            System.out.println("#"+tc+" "+result);
        }
    }
    
    public static void sort(int[] array) {
        int length = array.length;
        for(int i = 0; i < length; i++) {
            for(int j = i+1; j < length; j++) {
                if(array[i] > array[j]) {
                    int temp = array[i];
                    array[i] = array[j];
                    array[j] = temp;
                }
            }
        }
    }
}