글 읽기 - 이게 왜 틀린거죠? 반례 링크탄거 전부 해봤는데

ssh9234 2년 전 0

예제랑 인터넷으로 검색한 반례 싹 넣어봤는데 문제가 없는데 어디서 틀린거죠??

import java.util.Scanner;

public class Main{
    public static void main(String args[]){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int docNum = 0;
        int myNumPos = 0;
        int [] printer ;
        for(int i =0;i<n;i++){
            docNum = scan.nextInt();
            myNumPos = scan.nextInt();
            Queue4 q = new Queue4();
            for(int j = 0; j <docNum;j++){
                if(j==myNumPos){
                    q.push(scan.nextInt(),-1);
                }else{
                    q.push(scan.nextInt(),0);
                }
            }
            int res=1;
            while(true){
                int fiter = q.getFront();
                if(q.nowPrint(fiter+1)){
                    int []num = q.pop();
                    if(num[1]==-1){
                        System.out.println(res);
                        break;
                    }else{
                        res++;
                    }
                }else{
                    int num[] = q.pop();
                    q.push(num[0],num[1]);
                }
                

            }





        }
        scan.close();
    }

}
class Queue4 {
    int front = -1;
    int end = -1;
    int arr[][] = new int[100000][2];

    public int getFront(){
        return front;
    }

    public void push(int k,int i) {
        arr[++end][0] = k;
        arr[end][1]=i;
    }

    public int size() {
        return (end - front);
    }

    public int[] pop() {
        int[] res = new int[2];
        if (front >= end) {
            res[0]=-1;
            return res;
        } else {
            res[0]=arr[++front][0];
            res[1]=arr[front][1];
            return res;
        }
    }

    public int empty() {
        if (front >= end) {
            return 1;
        } else {
            return 0;
        }
    }
    public boolean nowPrint(int f){
        int nowPos = f;
        for(int i =f;i<end;i++){
            if(arr[i][0]>arr[nowPos][0]){
                return false;
            }
        }
        return true;
    }

    public int front() {
        if (front >= end) {
            return -1;
        } else {
            return arr[front + 1][0];
        }
    }

    public int back() {
        if (end <= front) {
            return -1;
        } else {
            return arr[end][0];
        }
    }
}