Submission #1187714

#TimeUsernameProblemLanguageResultExecution timeMemory
1187714oviyan_gandhiExamination (JOI19_examination)C++17
2 / 100
3095 ms2044 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;

#define N 100001
int S[N], T[N];

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, q; cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> S[i] >> T[i];
    for (int i = 1; i <= q; i++) {
        int x, y, z; cin >> x >> y >> z;
        int ans = 0;
        for (int j = 1; j <= n; j++)
            ans += (S[j] >= x && T[j] >= y && (S[j] + T[j]) >= z);
        cout << ans << endl;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...