-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy pathADARAIN.cpp
39 lines (35 loc) · 1.01 KB
/
ADARAIN.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/*Let's get high :D*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007LL
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define M_PI 3.14159265358979323846
template <typename T> T gcd(T a, T b){return (b==0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a, T b){return a*(b/gcd(a,b));}
template <typename T> T mod_exp(T b, T p, T m){T x = 1;while(p){if(p&1)x=(x*b)%m;b=(b*b)%m;p=p>>1;}return x;}
template <typename T> T invFermat(T a, T p){return mod_exp(a, p-2, p);}
template <typename T> T exp(T b, T p){T x = 1;while(p){if(p&1)x=(x*b);b=(b*b);p=p>>1;}return x;}
const int MAXN = 1e6+5;
int arr[MAXN];
int main(){
io;
int n, m, w;
cin >> n >> m >> w;
for(int i = 0;i < n; i++){
int a, b;
cin >> a >> b;
arr[a] += 1;
arr[b+1] -= 1;
}
for(int i = 1;i <= w; i++){
arr[i] += arr[i-1];
}
for(int i = 0;i < m; i++){
int a;
cin >> a;
cout << arr[a] << endl;
}
return 0;
}