算法笔记
差分数组在区间内的值不需要改变,只需要改变差分数组位置和始末位置的值
sort()排序函数,输入数组的排序起始位置和终止位置
include [HTML_REMOVED]
include [HTML_REMOVED]
include [HTML_REMOVED]
using namespace std;
int b[1000010];
int main()
{
int n,k;
scanf(“%d%d”,&n,&k);
while(k–)
{
int l,r;
scanf(“%d%d”,&l,&r);
b[l];
b[r+1]–;
}
for(int i = 1;i <= n;i) b[i]+=b[i-1];
sort(b+1,b+n+1);
printf(“%d”,b[(n+1)/2]);
return 0;
}