[BOJ] 1966 프린터 큐 (JAVA)

https://www.acmicpc.net/problem/1966

1966번: 프린터 큐

Queue를 이용하여 Priority Queue 비슷하게 만들어보는 문제입니다.

 

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;

public class Main {

    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StringBuilder sb = new StringBuilder();
    static StringTokenizer st;

    public static void main(String[] args) throws Exception {

        int T = Integer.parseInt(br.readLine());

        for (int tc = 0; tc < T; tc++) {

            Queue<Document> q = new LinkedList<>();
            st = new StringTokenizer(br.readLine(), " ");
            int N = Integer.parseInt(st.nextToken());
            int M = Integer.parseInt(st.nextToken());
            st = new StringTokenizer(br.readLine(), " ");
            for (int i = 0; i < N; i++) {
                q.offer(new Document(i, Integer.parseInt(st.nextToken())));
            }

            int cnt = 1;
            while(!q.isEmpty()) {

                Document d = q.poll();

                int size = q.size();
                boolean flag = true;

                while(size-- > 0) {

                    Document temp = q.poll();

                    if(flag && d.importance < temp.importance) flag = false;

                    q.offer(temp);

                }

                if(flag) {

                    if(d.index == M) {
                        sb.append(cnt).append("\n");
                        break;
                    }

                    cnt++;

                } else q.offer(d);

            }

        }

        System.out.print(sb.toString());
		
	}
	
    static class Document {

        int index, importance;

        public Document(int index, int importance) {

            this.index = index;
            this.importance = importance;

        }

    }
	
}