输入要求:
第一行为活动的个数 N(1<=N<=1 000 000) 。
接下来 N 行为 Si 和 Fi(0<=Si
include
include
using namespace std;
typedef struct node
{
int s;
int flag;
}NODE;
NODE a[2000100];
bool cmp(NODE a, NODE b);
int main()
{
int n;
cin >> n;
for (int i = 0; i < 2*n; i++)
{
scanf(“%d”, &a[i].s);
if (i % 2 == 0)
a[i].flag = 1;
else
a[i].flag = -1;
}
sort(a, a +2* n, cmp);
int sum = 0, max = 0;
for (int i = 0; i <2* n; i++)
{
sum += a[i].flag;
if (sum>max)
max = sum;
}
cout << max << endl;
}
bool cmp(NODE a, NODE b)
{
if (a.s == b.s)
return a.flag < b.flag;
else
return a.s < b.s;
}
`