【分治】聪明的质检员

http://icpc.upc.edu.cn/problem.php?cid=1681&pid=1 

#include<cstdio>
#include<iostream>
#include<cmath>
#define N 200050
#define ll long long
using namespace std;
ll ans=100000000000000,n,i,m,j,k,t,mid,max1,S,l[N],r[N],L,R,w[N],v[N],s[N],c[N];
ll check(int x)
{
	ll t=0;
	for(int i=1;i<=n;i++)
	{
		s[i]=s[i-1];
		c[i]=c[i-1];
		if(w[i]>=x)
		{
			s[i]+=v[i];
			c[i]++;
		}
	}
	for(int i=1;i<=m;i++)
		t+=(c[r[i]]-c[l[i]-1])*(s[r[i]]-s[l[i]-1]);
	return t;
}
int main()
{
	scanf("%lld%lld%lld",&n,&m,&S);
	for(i=1;i<=n;i++){
		scanf("%lld%lld",&w[i],&v[i]);
		max1=max(max1,w[i]);
	}
	for(i=1;i<=m;i++)
		scanf("%lld%lld",&l[i],&r[i]);
	L=0;
	R=max1+1;
	while(L<=R)
	{
		mid=(L+R)>>1;
		t=check(mid);
		ans=min(ans,(ll)abs(t-S));
		if(t<S)R=mid-1;
		else L=mid+1;
	}
	printf("%lld\n",ans);
}