C++ 代码

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n,m,a[300005],s[300005];
vector<int>alls;
vector<pair<int,int>>add,query;
int find(int x)
{
    int l=0,r=alls.size()-1,mid;
    while(l<r){
        mid=(l+r)>>1;
        if(alls[mid]>=x)r=mid;
        else l=mid+1;
    }
    return r+1;
}
vector<int>::iterator unique(vector<int>&a)
{
    int j=0,i;
    for (i=0;i<a.size();i++)
        if(!i||a[i]!=a[i-1])a[j++]=a[i];
    return a.begin()+j;
}
int main()
{
    int i,l,r,x,c;
    cin>>n>>m;
    for(i=0;i<n;i++){
        cin>>x>>c;
        add.push_back({x,c});
        alls.push_back(x);
    }
    for(i=0;i<m;i++){
        cin>>l>>r;
        query.push_back({l,r});
        alls.push_back(l);
        alls.push_back(r);
    }
    sort(alls.begin(), alls.end());
    alls.erase(unique(alls), alls.end());
    for(auto item:add){
        x=find(item.first);
        a[x]+=item.second;
    }
    for(i=1;i<=alls.size();i++)s[i]=s[i-1]+a[i];
    for(auto item:query){
        l=find(item.first),r=find(item.second);
        cout<<s[r]-s[l-1]<<endl;
    }
    return 0;
}