0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-22 14:11:59 +00:00
OI-codes/AcWing/2041/2041.cpp

26 lines
440 B
C++
Raw Normal View History

#include <algorithm>
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
const int N = 1000005;
int n, k, a, b, s[N], f[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cin >> a >> b;
s[a] += 1;
s[b + 1] -= 1;
}
for (int i = 1; i <= n; i++) {
f[i] = f[i - 1] + s[i];
}
std::sort(f + 1, f + 1 + n);
cout << f[n / 2 + 1] << endl;
return 0;
}