itsa基 19 最少派車數

#include <iostream>
using namespace std;

int main()
{
int n,s,d,max;
int time[25] = {0};
cin >> n;
max = 0;
for (int i = 0;i < n; i++)
{
cin >> s >> d;
for (int j = s;j < d; j++)
{
time[j]++;
}
for (int k = 0;k < 25; k++)
{
if (time[k] > max)
max = time[k];
}
}
cout << max << endl;
return 0;
}