美团 - 流星
作者:
liweidong
,
2023-03-11 22:05:17
,
所有人可见
,
阅读 233
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int n;
int a[N], b[N];
int s[N], t[N];
void insert(int a[], int l, int r, int c){
a[l] += c;
a[r+1] -= c;
}
int main(){
cin >> n;
int m = 0;
for(int i=1;i<=n;i++){
cin >> s[i];
}
for(int i=1;i<=n;i++){
cin >> t[i];
m = max(m, t[i]);
}
for(int i=1;i<=n;i++) insert(a, s[i], t[i], 1);
for(int i=1;i<=m;i++) b[i] = b[i-1] + a[i];
int max_num = 0;
int cnt = 0;
for(int i=1; i<=m; i++){
int x = b[i];
if(x == max_num) cnt++;
else if(x > max_num){
max_num = x;
cnt = 1;
}
}
cout<<max_num<<" "<<cnt<<endl;
return 0;
}