title: Count Pairs Two Sorted Arrays Whose Sum Equal Given Value X 1
signature: function countPairsTwoSortedArraysWhoseSumEqualGivenValueX1(arr1, arr2, m, n, x) {
source_py: def count_pairs_two_sorted_arrays_whose_sum_equal_given_value_x_1(arr1, arr2, m, n, x):
      count = 0
      us = set()
      for i in range(m):
          us.add(arr1[i])
      for j in range(n):
          if ((x - arr2[j]) in us):
              count += 1
      return count
source_cpp: int count_pairs_two_sorted_arrays_whose_sum_equal_given_value_x_1(vector<int> arr1, vector<int> arr2, int m, int n, int x) {
    int count = 0;
    unordered_set < int > us;
    for ( int i = 0;
    i < m;
    i ++ ) us . insert ( arr1 [ i ] );
    for ( int j = 0;
    j < n;
    j ++ ) if ( us . find ( x - arr2 [ j ] ) != us . end ( ) ) count ++;
    return count;
  }