c++进行数据离散化

题目链接：https://www.acwing.com/problem/content/804/
核心stl语句：

    sort(alls.begin(),alls.end());
    alls.erase(unique(alls.begin(),alls.end()),alls.end());

//https://www.acwing.com/problem/content/804/
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
typedef pair<int,int>PII;
typedef long long LL;
vector<PII>add,query;
vector<int>alls;
int n,m,l,r,x,c;
LL sum[N*3];
int find(int x){
    int l=-1,r=alls.size();
    while(l+1<r){
        int mid=(l+r)>>1;
        if(alls[mid]<x)l=mid;
        else r=mid;
    }
    return r+1;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>x>>c;
        add.push_back({x,c});
        alls.push_back(x);
    }
    for(int i=1;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.begin(),alls.end()),alls.end());
    for(int i=0;i<add.size();i++){
        x=find(add[i].first);
        c=add[i].second;
        sum[x]+=c;
    }
    for(int i=1;i<=alls.size();i++)sum[i]=sum[i-1]+sum[i];
    for(int i=0;i<query.size();i++){
        l=find(query[i].first);
        r=find(query[i].second);
        cout<<sum[r]-sum[l-1]<<endl;
    }
    return 0;
}