fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ms(s,n) memset(s,n,sizeof(s))
  5. #define all(a) a.begin(),a.end()
  6. #define present(t, x) (t.find(x) != t.end())
  7. #define sz(a) int((a).size())
  8. #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
  9. #define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
  10. #define pb push_back
  11. #define pf push_front
  12. #define fi first
  13. #define se second
  14. #define mp make_pair
  15.  
  16. typedef long long ll;
  17. typedef unsigned long long ull;
  18. typedef long double ld;
  19. typedef pair<int,int> pi;
  20. typedef vector<int> vi;
  21. typedef vector<pi> vii;
  22.  
  23. const int MOD = (int) 1e9+7;
  24. const int INF = (int) 1e9+1;
  25. inline ll gcd(ll a,ll b){ll r;while(b){r=a%b;a=b;b=r;}return a;}
  26. inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
  27.  
  28. void TC(){
  29. int n, m, k; cin >> n >> m >> k;
  30. int a[n], b[m];
  31. for(int &x : a) cin >> x;
  32. for(int &x : b) cin >> x;
  33. sort(a, a + n);
  34. sort(b, b + m);
  35. int ans = 0;
  36. int i = 0, j = 0;
  37. while(i < n && j < m){
  38. if(abs(a[i]-b[j]) <= k){
  39. ++ans;
  40. ++i; ++j;
  41. }
  42. else if(a[i] - b[j] > k){
  43. ++j;
  44. }
  45. else ++i;
  46. }
  47. cout << ans << endl;
  48. }
  49.  
  50. int main(){
  51. //freopen("input.txt","r", stdin);
  52. //freopen("output.txt","w",stdout);
  53. ios::sync_with_stdio(false);
  54. cin.tie(nullptr);
  55. int t; t = 1;
  56. while(t--){
  57. TC();
  58. }
  59. }
Success #stdin #stdout 0.01s 5588KB
stdin
Standard input is empty
stdout
540