aboutsummaryrefslogtreecommitdiff
path: root/codeforces/closestToTheLeft/main.cpp
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2022-11-05 01:28:02 +0200
committeromagdy7 <omar.professional8777@gmail.com>2022-11-05 01:28:02 +0200
commitc52b36c6a37fdb1d1de146d3939cb42e2c691f44 (patch)
treeb13bbc546bf9505c875dde5d26424d39d23054c9 /codeforces/closestToTheLeft/main.cpp
parentb79a55ceee2f4532ef6621f9d86c6c61543ce6c9 (diff)
downloadcompetitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.tar.xz
competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.zip
Solved 6 problem in filtrationContest and restructured the repo
Diffstat (limited to 'codeforces/closestToTheLeft/main.cpp')
-rw-r--r--codeforces/closestToTheLeft/main.cpp36
1 files changed, 36 insertions, 0 deletions
diff --git a/codeforces/closestToTheLeft/main.cpp b/codeforces/closestToTheLeft/main.cpp
new file mode 100644
index 0000000..d058458
--- /dev/null
+++ b/codeforces/closestToTheLeft/main.cpp
@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int bs(vector<int> &a, int toFind) {
+ int low = -1;
+ int high = a.size();
+ int mid = (high + low) / 2;
+ while (low + 1 < high) {
+ if (a[mid] <= toFind) {
+ low = mid;
+ } else {
+ high = mid;
+ }
+ mid = (high + low) / 2;
+ }
+ return low;
+}
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int n, k;
+ cin >> n >> k;
+
+ vector<int> a(n);
+ vector<int> q(n);
+
+ for (int &x : a)
+ cin >> x;
+ for (int i = 0; i < k; i++) {
+ int y;
+ cin >> y;
+ cout << bs(a, y) + 1 << endl;
+ }
+}