CCF 201809-2 买菜 100分

#include <iostream>

using namespace std;

unsigned int a[2001][2];
unsigned int b[2001][2];
unsigned int sum = 0;
int time[1000000];
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char** argv) 
{
	unsigned int n = 0;
	unsigned int max = 0;
	cin >> n;
	
	for(int i = 0; i < 2 * n; i++)
	{
		(i < n) ? (cin >> a[i][0] >> a[i][1]) : (cin >> b[i-n][0] >> b[i-n][1]);
	}
	
	for(int i = 0; i < n; i++)
	{	
		for(int m = a[i][0]; m < a[i][1]; m++)
		{
			time[m]++;
		}
		for(int n = b[i][0]; n < b[i][1]; n++)
		{
			time[n]++;
		}
	}
	(a[n-1][1] > b[n-1][1]) ? (max = a[n-1][1]) : (max = b[n-1][1]) ;
	
	for(int i = 0; i < max; i++)
	{
		if(time[i] == 2)
		sum++;
	}
	
	cout << sum; 
	return 0;
}