제출 #1193104

#제출 시각아이디문제언어결과실행 시간메모리
1193104GoBananas69Examination (JOI19_examination)C++20
2 / 100
3095 ms1260 KiB
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <vector>
#include <cstdint>
using namespace std;

typedef int64_t ll;

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int n, q;
    cin >> n >> q;
    vector<int> s(n), t(n);
    for (int i = 0; i<n; ++i) {
        cin >> s[i] >> t[i];
    }
    while (q--) {
        int a, b, c;
        cin >> a >> b >> c;
        int cnt = 0;
        for (int i = 0; i<n; ++i) {
            if (s[i] >= a && t[i] >= b && s[i] + t[i] >= c) {
                ++cnt;
            }
        }
        cout << cnt << '\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...