Moving Tables

思路：计算每个房间前走廊被占用次数，次数最多的乘以10就是结果。

#include <iostream>
#include<algorithm>
using namespace std;

int c[210];

int main(){
	int t, n;
	cin >> t;
	while (t--){
		memset(c, 0, sizeof(c));
		cin >> n;
		for (int i = 0; i < n; i++){
			int a, b;
			cin >> a >> b;
			if (a % 2 != 0) a++;
			if (b % 2 != 0) b++;
			a /= 2; b /= 2;
			if (a > b) swap(a, b);
			for (int j = a; j <= b; j++){
				c[j]++;
			}
		}
		int maxn = -1;
		for (int i = 0; i < 210;i++){
			if (maxn < c[i]) maxn = c[i];
		}
		cout << 10 * maxn << "\n";
	}
	return 0;
}