P1314 [NOIP2011 提高组] 聪明的质监员(二分答案)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e6+10;
ll n,m,s,lx[N],rx[N],sn[N],sv[N],w[N],v[N],ans=1e18+10;;
bool check(int x){
	memset(sv,0,sizeof sv);
	memset(sn,0,sizeof sn);
	for(int i=1;i<=n;i++){
		if(w[i]>=x)sn[i]=sn[i-1]+1,sv[i]=sv[i-1]+v[i];
		else sn[i]=sn[i-1],sv[i]=sv[i-1];
	} 
	ll y=0;
	for(int i=1;i<=m;i++){
		y=y+(sn[rx[i]]-sn[lx[i]-1])*(sv[rx[i]]-sv[lx[i]-1]);
	}
	ans=min(ans,llabs(y-s));
	return y<=s;
}
void solve(){
   cin>>n>>m>>s;
   for(int i=1;i<=n;i++) cin>>w[i]>>v[i];
   for(int i=1;i<=m;i++) cin>>lx[i]>>rx[i];
   
   ll l=0,r=1e6+10;
   while(l+1<r){
   	int mid=l+r>>1;
   	if(check(mid))r=mid;
   	else l=mid;
   }
   cout<<ans<<"\n";
}
int main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	solve();
	return 0;
}