-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathapartments.cpp
37 lines (32 loc) · 871 Bytes
/
apartments.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
std::cin >> n >> m >> k;
std::vector<int> applicants(n);
std::vector<int> apartments(m);
for (int i = 0; i < n; ++i) {
std::cin >> applicants[i];
}
for (int i = 0; i < m; ++i) {
std::cin >> apartments[i];
}
std::sort(applicants.begin(), applicants.end());
std::sort(apartments.begin(), apartments.end());
int i = 0, j = 0, matches = 0;
for(int i=0;i<n;i++){
while (j < m) {
if (std::abs(applicants[i] - apartments[j]) <= k) {
++matches;
++j;
break;
} else if (apartments[j] < applicants[i] - k) {
++j;
}else{
break;
}
}
}
std::cout << matches << std::endl;
return 0;
}