csp 买菜

#include<iostream>
using namespace std;
struct Time
{
 int a;
 int b;
};
int GetMin(int a,int b)
{
 if (a >= b)
  return b;
 return a;
}
int GetMax(int a, int b)
{
 if (a >= b)
  return a;
 return b;
}
int main()
{
 int n;
 cin >> n;
 Time H [2000];
 Time W [2000];
 int count = 0;
 for (int i = 0; i < n; i++)
 {
  cin >> H[i].a >> H[i].b;
 }
 for (int i = 0; i < n; i++)
 {
  cin >> W[i].a >> W[i].b;
 }
 for (int i = 0; i < n; i++)
 {
  for (int j = 0; j < n; j++)
  {
   int max = GetMax(H[i].a, W[j].a);
   int min = GetMin(H[i].b, W[j].b);
   if (min > max)
   {
    count = count + min - max;
   }
   else
    continue;
  }
 }
 cout << count << endl;
}