滑动窗口（JAVA）超时

用队列暴力解法，超时了

import java.util.Scanner;

public class Main {
    static int N = 1000010;
    static int[] queue = new int[N];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int tt = 0;
        int hh = 0;
        int n = sc.nextInt();
        int[] num = new int[n];
        int k = sc.nextInt();
        int[] MIN = new int[n];
        int[] MAX = new int[n];
        for (int i = 0; i < n; i++) {
            num[i] = sc.nextInt();
        }
        for (int i = 0; i < n; i++) {
            queue[tt++]=num[i];
            if(tt-hh<k){
                continue;
            }
            int min = Integer.MAX_VALUE;
            int max = Integer.MIN_VALUE;
            for (int j =hh; j < tt; j++) {
                min = Math.min(queue[j],min);
                max = Math.max(queue[j],max);
            }
            MIN[i] = min;
            MAX[i] = max;
            hh++;
        }
        for (int i = k-1; i <n; i++) {
            System.out.print(MIN[i]+" ");
        }
        System.out.println();
        for (int i = k-1; i <n; i++) {
            System.out.print(MAX[i]+" ");
        }
    }
}