4408. 자기 방으로 돌아가기

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
bool compare(const pair<int, int>& a, const pair<int, int>& b)
{
	return a.first < b.first;
}
bool all_com(int n, int* v)
{
	for (int i = 0; i < n; i++)
	{
		if (v[i] == 0)
			return false;
	}
	return true;
}

int main()
{
	int T;
	scanf("%d", &T);
	for (int i = 0; i < T; i++)
	{
		vector<pair<int, int>> time_lst;
		int visited[401];
		memset(visited, 0, sizeof(visited));
		int ans = 0;
		int N;
		scanf("%d", &N);

		int s, e;
		for (int j = 0; j < N; j++)
		{
			s = 0; e = 0;
			scanf("%d %d", &s, &e);
			if (s > e)
			{
				if (s % 2 == 1)
					s += 1;
				time_lst.push_back(make_pair(e, s));
			}
			else
			{
				if (e % 2 == 1)
					e += 1;
				time_lst.push_back(make_pair(s, e));
			}
		}
		sort(time_lst.begin(), time_lst.end(), compare);
		
		while (!all_com(N, visited))
		{
			int finish = 0;
			for (int k = 0; k < N; k++)
			{
				if (visited[k] == 1)
					continue;
				if (time_lst[k].first > finish)
				{
					visited[k] = 1;
					finish = time_lst[k].second;
				}
			}
			
			ans++;
		}
		printf("#%d %d\n", i + 1, ans);
	
	}
}