离散化

#include<bits/stdc++.h>
using namespace std;
vector<int>alls;
typedef pair<int,int>PII;
vector<PII>add,query;
const int N = 3e5+10;
int n,m,a[N];
int find(int x){
	int l = 0;int r = alls.size()-1;
	while(l<r){
		int mid = (l+r)/2;
		if(alls[mid]>=x)r = mid;
		else l = mid+1;
	}
	return l+1;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i = 1;i<=n;i++){
		int x,c;
		scanf("%d%d",&x,&c);
		alls.push_back(x);
		add.push_back({x,c});
	}
	for(int i = 1;i<=m;i++){
		int l,r;
		scanf("%d%d",&l,&r);
		alls.push_back(l);
		alls.push_back(r);
		query.push_back({l,r});
	}
	sort(alls.begin(),alls.end());
	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++)a[i]+=a[i-1];
	for(auto item:query){
		int l = find(item.first);
		int r = find(item.second);
		printf("%d\n",a[r]-a[l-1]);
	}
}

离散化+二分+前缀和

802. 区间和 - AcWing题库