15：离散化_for(auto item:a)-CSDN博客

本文链接：https://blog.csdn.net/arabianjasmine/article/details/123113459

排序：sort（lsh.begin()，lsh.end());

去重：lsh.erase(unique(lsh.begin(), lsh.end()), lsh.end());

1：将原数组进行排序，去重。

2：用二分找出原数组中各个数在排序去重后的下标。

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> PII;

const int N = 1e6 + 10;

int n, m;

vector<PII> a, b;
vector<int> lsh;

int ans[N], add[N];

int find(int x)//二分
{
    int l = -1, r = lsh.size();
    
    while(l + 1 != r)
    {
        int mid = l + r >> 1;
        
        if(x <= lsh[mid]) r = mid;
        else l = mid;
    }
    
    return r + 1;
}

int main()
{
    cin >> n >> m;
    
    for(int i = 0; i < n; i ++)
    {
        int point, nub;
        cin >> point >> nub;
        a.push_back({point, nub});
        lsh.push_back(point);
    }
    
    for(int i = 0; i < m; i ++)
    {
        int l, r;
        cin >> l >> r;
        b.push_back({l, r});
        lsh.push_back(l); lsh.push_back(r);
    }
    
    sort(lsh.begin(), lsh.end()); //排序，去重
    lsh.erase(unique(lsh.begin(), lsh.end()), lsh.end());
    
    for(auto item : a)//遍历a
    {
        int point  = find(item.first);
        ans[point] += item.second;
    }
    
    int sum = 0, len = lsh.size();//前缀和
    for(int i = 1; i <= len; i ++)
    {
        sum += ans[i];
        add[i] = sum;
    }
    
    
    for(auto item : b)
    {
        int l = find(item.first);
        int r = find(item.second);
        cout << add[r] - add[l - 1] << endl;
    }
return 0;}