AC代码可以参考一下
```cpp
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int M = 2e5 + 5;
int n, m, x, y, mid;
int w[N], v[N];
int l[M], r[M];
long long s;
long long ans;
long long sum;
long long pw[N], pv[N];
int main() {
cin >> n >> m >> s;
ans = s;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
y = max(y, w[i]);
}
for (int i = 1; i <= m; i++) {
cin >> l[i] >> r[i];
}
x = 0;
y++;
while (x < y) {
memset(pw, 0, sizeof(pw));
memset(pv, 0, sizeof(pv));
mid = (x + y) >> 1;
sum = 0;
for (int i = 1; i <= n; i++) {
if (w[i] > mid) {
pw[i] = pw[i - 1] + 1;
pv[i] = pv[i - 1] + v[i];
} else {
pw[i] = pw[i - 1];
pv[i] = pv[i - 1];
}
}
for (int i = 1; i <= m; i++) {
sum += (long long)(pw[r[i]] - pw[l[i] - 1]) * (pv[r[i]] - pv[l[i] - 1]);
}
if (sum == s) {
ans = 0;
break;
} else {
ans = min(ans, abs(sum - s));
if (sum <= s) {
y = mid;
} else {
x = mid + 1;
}
}
}
cout << ans;
return 0;
}
```
by 崔泽禹 @ 2023-01-06 07:36:09