【区间和(模板题)】

前缀和 +离散化(因为内存过不去)

#include <bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#define IO (ios::sync_with_stdio(false),cin.tie(0),cout.tie(0))
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define fors(i,a,b) for(int i = a; i < b; ++i)
#define debug(x) cerr<<#x<<" = "<<x<<endl

using namespace std;
typedef long long ll;
typedef pair<int,int> PII;

const ll mod = 1e9+7;
const int N = 3e5+10;

ll res, ans, cnt;
int n, m, x, y;
int a[N];
int s[N];
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;
    
    while (n -- )
    {
        cin >> x >> y;
        
        add.push_back({x, y});
        
        alls.push_back(x);
    }
    
    while (m -- )
    {
        cin >> x >> y;
        query.push_back({x, y});
        
        alls.push_back(x);
        alls.push_back(y);
    }
    
    //去重
    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;
    }
    
    //预处理前缀和
    rep(i, 1, alls.size()) 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;
}