9.22

离散化

include

include

include

using namespace std;
typedef pair<int,int>PII;
//alls用来记录
vectoralls;
//add query分别增添和查找
vectoradd,query;
const int N=300010;
int a[N],s[N];
//简单的二分用来查找
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()
{
int n,m;
cin>>n>>m;
while(n--)
{
int x,c;
cin>>x>>c;
add.push_back({x,c});
alls.push_back(x);
}
while(m--)
{
int l,r;
cin>>l>>r;
query.push_back({l,r});
alls.push_back(l);
alls.push_back(r);
}
//alls排序
sort(alls.begin(),alls.end());
//删除alls里的重复元素
alls.erase(unique(alls.begin(),alls.end()),alls.end());
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];
for(auto item:query)
{
int l=find(item.first),r=find(item.second);
cout<<s[r]-s[l-1]<<endl;
}
return 0;
}