[NOIP 2011]聪明的质检员 二分+前缀和

代码

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
//o(klogn)

ll n,m,s,w[200010],v[200010],maxn=0,l,r,mid,prew[200010],pren[200010],last(100000000005),y;
int li[200010],ri[200010];

ll Ans(ll x){
    ll ans=0;
    for(int i=1;i<=n;i++){
        if(w[i]>=x) {
            prew[i]=prew[i-1]+v[i];
            pren[i]=pren[i-1]+1;    
        }else{
            prew[i]=prew[i-1];
            pren[i]=pren[i-1];
        }   
    }

    for(int i=1;i<=m;i++){
        ans+=(pren[ri[i]]-pren[li[i]-1])*(prew[ri[i]]-prew[li[i]-1]);
    }
    return ans;
}

void Bisection(){
    l=0;r=maxn+1;
    while(l<=r){
        mid=(l+r)>>1;
        y=Ans(mid);
        last=min(last,abs(y-s));
        if(y<s){
            r=mid-1;
        }else{
            l=mid+1;
        }
    }   
    cout<<last<<endl;
}
void Initialize(){
    memset(prew,0,sizeof(prew));
    memset(pren,0,sizeof(pren));
}
int main(){
    Initialize();
    cin>>n>>m>>s;
    for(int i=1;i<=n;i++){
        scanf("%lld%lld",&w[i],&v[i]);
        maxn=max(maxn,w[i]);
    }
    for(int i=1;i<=m;i++){
        scanf("%lld%lld",&li[i],&ri[i]);
    }
    Bisection();
    return 0;
}