TLE求调

#include<bits/stdc++.h>
using namespace std;
int n,m,l[200001],r[200001],q[200001];
long long s,maxn=LLONG_MAX;
struct stuff{
	int weight,value;
}a[200001];
bool cmp(stuff a,stuff b){
	return a.weight<b.weight;
}
int main(){
	cin >> n >> m >> s;
	for(int i=1;i<=n;i++) cin >> a[i].weight >> a[i].value;
	for(int i=1;i<=m;i++) cin >> l[i] >> r[i];
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++) q[i]=q[i-1]+a[i].value;
	int left=-1,right=a[n].weight+1;
	while(left<right+1){
		int mid=(left+right)>>1;
		long long sum=0;
		for(int i=1;i<=m;i++){
			int le=l[i]-1,ri=r[i]+1;
            while(le<ri-1){
                int mi=(le+ri)>>1;
                if(mi<mid) le=mid;
                else ri=mid;
            }
			if(le<=r[i]) sum+=(r[i]-le+1)*(q[r[i]]-q[le-1]);
		}
		maxn=min(maxn,abs(s-sum));
	}
	cout << maxn;
	return 0;
}