From ef09dc1158cfb989a59af5e987d1791d159ad055 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.magdy8777@gmail.com>
Date: Mon, 13 Mar 2023 12:59:41 +0200
Subject: Solved some problems

---
 cses/SortingAndSearching/Apartments/main     | Bin 63000 -> 17200 bytes
 cses/SortingAndSearching/Apartments/main.cpp |  18 +-----------------
 2 files changed, 1 insertion(+), 17 deletions(-)

(limited to 'cses/SortingAndSearching/Apartments')

diff --git a/cses/SortingAndSearching/Apartments/main b/cses/SortingAndSearching/Apartments/main
index 946f3f6..82bae9d 100755
Binary files a/cses/SortingAndSearching/Apartments/main and b/cses/SortingAndSearching/Apartments/main differ
diff --git a/cses/SortingAndSearching/Apartments/main.cpp b/cses/SortingAndSearching/Apartments/main.cpp
index 676f338..33c3914 100755
--- a/cses/SortingAndSearching/Apartments/main.cpp
+++ b/cses/SortingAndSearching/Apartments/main.cpp
@@ -10,22 +10,6 @@ int main () {
 	cin.tie(NULL);
   int n, m, k;
   cin >> n >> m >> k;
-  set<int> taken;
-  vector<int> v(n);
-  vector<int> a(m);
-  for (auto &x : v) cin >> x;
-  for (auto &x : a) cin >> x;
-  sort(all(a));
-  int ans = 0;
-  for (int i = 0; i < n; i++) {
-    auto upper = *upper_bound(all(a), v[i]);
-    auto lower = *lower_bound(all(a), v[i]);
-    cerr << upper << " " << lower << "\n";
-    if(!taken.count(i) && (upper <= v[i] + k || lower >= v[i] - k)) {
-      taken.insert(i);
-      ans++;
-    }
-  }
-  cout << ans << '\n';
+  
 
 }
-- 
cgit v1.2.3