用离散化的思想来做
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef pair<int,int> PII;
const int N=3e5+10;
int a[N],s[N];
int n,m;
vector<int> alls;
vector<PII> add,query;
//离散化过程
int find(int x)
{
int l=0,r=alls.size()-1;
while(l<r)
{
int mid=l+r>>1;
if(alls[mid]>=x) r=mid;
else l=mid+1;
}
return r+1;
}
int main()
{
cin>>n>>m;
//先将x,c,l,r存一遍
//处理add
for(int i=1;i<=n;i++)
{
int x,c;
cin>>x>>c;
add.push_back({x,c});
alls.push_back(x);
}
//处理query
for(int i=1;i<=m;i++)
{
int l,r;
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.begin(),alls.end()),alls.end());
//处理add,a[x]
for(auto item:add)
{
int x=find(item.first);
a[x]+=item.second;
}
//前缀和
for(int i=1;i<=alls.size();i++)
{
s[i]=s[i-1]+a[i];
}
//处理query,查询
for(auto item:query)
{
int l=find(item.first);
int r=find(item.second);
cout<<s[r]-s[l-1]<<endl;
}
return 0;
}