#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
class Solution{
public :
int findTheDistanceValue( vector< int > & A, vector< int > & B, int D) {
int i;
int res = 0 ;
for ( i= ( 0 ) ; i< ( A.size ( ) ) ; i++ ) {
int j;
for ( j= ( 0 ) ; j< ( B.size ( ) ) ; j++ ) {
if ( abs ( A[ i] - B[ j] ) <= D) {
goto Lj4PdHRW;
}
}
res++ ;
Lj4PdHRW:;
}
return res;
}
}
;
// cLay varsion 20200325-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// class Solution {
// public:
// int findTheDistanceValue(vector<int>& A, vector<int>& B, int D) {
// int res = 0;
// rep(i,A.size()){
// rep(j,B.size()) if(abs(A[i]-B[j]) <= D) break_continue;
// res++;
// }
// return res;
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KY2xhc3MgU29sdXRpb257CiAgcHVibGljOgogIGludCBmaW5kVGhlRGlzdGFuY2VWYWx1ZSh2ZWN0b3I8aW50PiYgQSwgdmVjdG9yPGludD4mIEIsIGludCBEKXsKICAgIGludCBpOwogICAgaW50IHJlcyA9IDA7CiAgICBmb3IoaT0oMCk7aTwoQS5zaXplKCkpO2krKyl7CiAgICAgIGludCBqOwogICAgICBmb3Ioaj0oMCk7ajwoQi5zaXplKCkpO2orKyl7CiAgICAgICAgaWYoYWJzKEFbaV0tQltqXSkgPD0gRCl7CiAgICAgICAgICBnb3RvIExqNFBkSFJXOwogICAgICAgIH0KICAgICAgfQogICAgICByZXMrKzsKICAgICAgTGo0UGRIUlc6OwogICAgfQogICAgcmV0dXJuIHJlczsKICB9Cn0KOwovLyBjTGF5IHZhcnNpb24gMjAyMDAzMjUtMQoKLy8gLS0tIG9yaWdpbmFsIGNvZGUgLS0tCi8vICNkZWZpbmUgbWFpbiBkdW1teV9tYWluCi8vIHt9Ci8vICN1bmRlZiBtYWluCi8vIAovLyBjbGFzcyBTb2x1dGlvbiB7Ci8vIHB1YmxpYzoKLy8gICBpbnQgZmluZFRoZURpc3RhbmNlVmFsdWUodmVjdG9yPGludD4mIEEsIHZlY3RvcjxpbnQ+JiBCLCBpbnQgRCkgewovLyAgICAgaW50IHJlcyA9IDA7Ci8vICAgICByZXAoaSxBLnNpemUoKSl7Ci8vICAgICAgIHJlcChqLEIuc2l6ZSgpKSBpZihhYnMoQVtpXS1CW2pdKSA8PSBEKSBicmVha19jb250aW51ZTsKLy8gICAgICAgcmVzKys7Ci8vICAgICB9Ci8vICAgICByZXR1cm4gcmVzOwovLyAgIH0KLy8gfTsK