프린터 큐 (feat. 백준, 1966번)

프린터 큐
https://www.acmicpc.net/problem/1966

1966번: 프린터 큐

 

반응형

 

// woohyeon.kim
// kim519620.tistory.com
#include <iostream>
#include <queue>
using namespace std;
int main()
{
	register int T, N, M, arr[100];
	cin >> T;
	for (register int t = 0, v; t < T; ++t) {
		cin >> N >> M;
		priority_queue<int> tmp;
		queue<pair<int, int>> ans;
		for (register int i = 0; i < N; ++i)
			cin >> v, ans.push(make_pair(i, v)), tmp.push(v);
		register int count = 0;
		while (!ans.empty()) {
			auto t = ans.front(); ans.pop();
			if (tmp.top() == t.second) {
				tmp.pop();
				++count;
				if (M == t.first) {
					cout << count << "\n";
					break;
				}
			}
			else
				ans.push(t);
		}
	}
	return 0;
}
// *&)*@*