//author:
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define ONLINE_JUDGE
void solve() {
int n;
cin >> n;
vector <pair <int, int>> vec(n +1);
for(int i = 1; i <= n; i++) {
cin >> vec[i].first >> vec[i].second;
}
map <int, int> mp;
for(int i = 1; i <= n; i++)
mp[vec[i].first] = mp[vec[i].second] = 0;
int cnt = 0;
for(auto &[a, b] : mp)
b = cnt++;
for(int i = 1; i <= n; i++)
vec[i].first = mp[vec[i].first], vec[i].second = mp[vec[i].second];
vector <int> pref(cnt + 5);
for(int i = 1; i <= n; i++) {
pref[vec[i].first]++;
pref[vec[i].second +1]--;
}
vector <int> arr = pref;
for(int i = 1; i <= cnt + 4; i++)
arr[i] += arr[i -1];
/*
for(int &i : arr)
cerr << i << " ";
*/
cout << *max_element(arr.begin(), arr.end());
int q;
cin >> q;
for(int i = 1; i <= q; i++) {
int l, r;
cin >> l >> r;
}
return;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t = 1; //cin >> t;
while(t--)
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
424 ms |
23476 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
860 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
860 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
439 ms |
24952 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
424 ms |
23476 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |