diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
| commit | c52b36c6a37fdb1d1de146d3939cb42e2c691f44 (patch) | |
| tree | b13bbc546bf9505c875dde5d26424d39d23054c9 /codeforces/fastSearch/main.cpp | |
| parent | b79a55ceee2f4532ef6621f9d86c6c61543ce6c9 (diff) | |
| download | competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.tar.xz competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.zip | |
Solved 6 problem in filtrationContest and restructured the repo
Diffstat (limited to 'codeforces/fastSearch/main.cpp')
| -rw-r--r-- | codeforces/fastSearch/main.cpp | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/codeforces/fastSearch/main.cpp b/codeforces/fastSearch/main.cpp new file mode 100644 index 0000000..64d97f9 --- /dev/null +++ b/codeforces/fastSearch/main.cpp @@ -0,0 +1,25 @@ +#include<bits/stdc++.h> + +using namespace std; + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int n; + cin >> n; + vector<int> a(n); + for(int &x : a) cin >> x; + int m; + cin >> m; + + int count = 0; + for(int i = 0; i < m; i++) { + int p1, p2; + cin >> p1 >> p2; + if(a[i] >= p1 && a[i] <= p2){ + count++; + } + } + cout << count << endl; + +} |
