# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1251648 | Kel_Mahmut | Examination (JOI19_examination) | C11 | 0 ms | 0 KiB |
#pragma GCC optimize ("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, q;
scanf("%d%d", &n, &q);
vector<int> S(n), T(n);
for(int i = 0; i < n; i++){
scanf("%d%d", &S[i], &T[i]);
}
int cnt = 0, A, B, C;
for(int i = 0; i < q; i++){
scanf("%d%d%d", &A, &B, &C);
for(int j = 0; j < n; j++){
if(S[j] >= A && T[j] >= B && S[j] + T[j] >= C){
cnt++;
}
}
printf("%d\n", cnt);
cnt = 0;
}
}