巧妙的类似贪心的做法
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
const int maxn = 500;
P itv[maxn];
int room[maxn];
int main(int argc, char const *argv[]) {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &itv[i].first, &itv[i].second);
if (itv[i].first > itv[i].second) {
swap(itv[i].first, itv[i].second);
}
if (itv[i].first & 1) {
itv[i].first++;
}
if (itv[i].second & 1) {
itv[i].second++;
}
for (int j = itv[i].first; j <= itv[i].second; j += 2) {
room[j]++;
}
}
printf("%d\n", *max_element(room, room + maxn) * 10);
memset(room, 0, sizeof(room));
}
return 0;
}