[NOIP2011]聪明的质监员

// Problem: P1314 [NOIP2011 提高组] 聪明的质监员
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P1314
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// 2022-04-25 13:53:23
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);
inline ll ksc(ll x,ll y,ll mod)
{
    ll ans = 0;
    while (y) {
    	if (y & 1)
    		ans = (ans + x) %mod;
    	y >>= 1;
    	x = (x + x) %mod;
	}
	return ans;
}
inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a;
		a = a * a;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
// inline ll inv (ll a) {
	// return qmi(a, mod - 2);
// }

#define int long long
const int N = 2e5 + 10;

int n, m, s;
pair<int, int> a[N], b[N];
int s1[N], s2[N];
int ans = 0x3f3f3f3f3f3f3f3f;
bool check (int tar) {
	memset(s1, 0, sizeof s1);
	memset(s2, 0, sizeof s2);
	for (int  i = 1; i <= n; i ++)
		if (a[i].fi >= tar) {
			s1[i] = 1;
			s2[i] = a[i].se;
		}
	for (int i = 1; i <= n; i ++) {
		s1[i] +=s1[i - 1];
		s2[i] += s2[i - 1];
	}
	int sum = 0;
	for (int i = 1; i <= m; i ++) {
		sum += (s1[b[i].se] - s1[b[i].fi - 1]) * 
			(s2[b[i].se] - s2[b[i].fi - 1]);
	}
	ans = min(ans, abs(s - sum));
	return s - sum >= 0;
}
void solve() {
	cin >> n >> m >> s;
	int l= 0, r = -1;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i].fi >> a[i].se;
		r = max (a[i].fi, r);
	}	
	l = 0;
	
	for (int i = 1; i <= m; i ++) {
		cin >> b[i].fi >> b[i].se;
	}
	r += 2;
	 while (l < r) {
		 int mid= l + r>> 1;
		 if (check(mid))
		{
			r = mid;
		}
		 else l = mid + 1;
	 }
	 cout << ans << endl;
}
signed main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

对于标准x，如果s - sum >= 0,那么表示还可以继续扩大，则令标准小一点，否则需要标准大一点，减少sum。发现这正好和二分板子的意义相同。