#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll interval(vector<ll>st, vector<ll>ft, int n)
{
ll i = 1, j = 0, dorker = 1, r = 1;
while(i < n && j < n)
{
if(st[i] <= ft[j])
{
dorker++;
i++;
if(dorker > r)
{
r = dorker;
}
}
else
{
dorker--;
j++;
}
}
return r;
}
int main()
{
int n, i, k = 1;
while(cin >> n && n != -1)
{
vector<ll>start, finish;
ll x, y;
for(i=0; i<n; i++)
{
cin >> x >> y;
start.push_back(x);
finish.push_back(y);
}
sort(start.begin(), start.end());
sort(finish.begin(), finish.end());
if(start.size() == 0 && finish.size() == 0)
{
cout << "Case " << k++ << ": " << 0 << "\n";
continue;
}
cout << "Case " << k++ << ": " << interval(start, finish, n) << "\n";
}
return 0;
}
Comments
Post a Comment