AcWing 802. 区间和
原题链接
简单
作者:
aabyte
,
2023-01-09 20:41:22
,
所有人可见
,
阅读 126
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef pair<int, int> PII;
int n, m, x, c, l, r;
vector<PII> alls;
int main()
{
cin >> n >> m;
for(int i = 0; i < n; ++i)
{
cin >> x >> c;
alls.push_back({x, c});
}
sort(alls.begin(), alls.end());
vector<int> b(alls.size() + 1, 0);
vector<int> q;
for(int i = 1; i <= n; ++i)
{
q.push_back(alls[i - 1].first);
b[i] = b[i - 1] + alls[i - 1].second;
}
while(m--)
{
cin >> l >> r;
int ll = lower_bound(q.begin(), q.end(), l) - q.begin();
int rr = upper_bound(q.begin(), q.end(), r) - q.begin();
cout << b[rr] - b[ll] << endl;
}
return 0;
}