3028. 【NOIP2011DAY2】聪明的质监员

---

题目：

传送门

---

分析：

裸裸的二分查找，但我实在是太水了以至于考试时都没$A$

---

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
#define mo 10007
using namespace std;
inline LL read(){
	LL d=0,f=1;char s=getchar();
	while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
	while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
	return d*f;
}
LL n=read(),m=read(),s=read();
LL min(LL x,LL y) {return x<y?x:y;}
LL max(LL x,LL y) {return x>y?x:y;}
LL w[200005],v[200005],z[200005],y[200005];
LL check(LL x)
{
	LL num[200005],sum[200005];
	for(LL i=1;i<=n;i++)
	{
		num[i]=num[i-1]+(w[i]>=x?1:0);
		sum[i]=sum[i-1]+(w[i]>=x?v[i]:0);
	}
	LL king=0;
	for(LL i=1;i<=m;i++)
	  king+=(num[y[i]]-num[z[i]-1])*(sum[y[i]]-sum[z[i]-1]);
	return king;
}
int main()
{
	LL l=0,r=1e12;
	for(LL i=1;i<=n;i++) w[i]=read(),v[i]=read();
	for(LL i=1;i<=m;i++) z[i]=read(),y[i]=read();
	LL ans=1e18;
	while(l<=r)
	{
		LL mid=(l+r+1)>>1;
		LL c=check(mid);
		ans=min(ans,abs(s-c));
		if(c<s) r=mid-1;
		else l=mid+1; 
	}
	cout<<ans;
	return 0;
}