HackerEarth Match makers problem solution

In this HackerEarth Match makers problem solution Little Mojo owns a match making company, which even to her surprise is an extreme hit. She says that her success rate cannot be matched (Yeah, wordplay!) in the entire match-making industry. She follows an extremely simple algorithm to determine if two people are matches for each other. Her algorithm is not at all complex, and makes no sense – not even to her. But she uses it anyway.

Let’s say say that on a given day she decides to select n people – that is, n boys and n girls. She gets the list of n boys and n girls in a random order initially. Then, she arranges the list of girls in ascending order on the basis of their height and boys in descending order of their heights. A girl Ai can be matched to a boy on the same index only, that is, Bi and no one else. Likewise, a girl standing on Ak can be only matched to a boy on the same index Bk and no one else.

Now to determine if the pair would make an ideal pair, she checks if the modulo of their heights is 0, i.e., Ai % Bi == 0 or Bi % Ai == 0. Given the number of boys and girls, and their respective heights in non-sorted order, determine the number of ideal pairs Mojo can find.

HackerEarth Match makers problem solution.

#include <bits/stdc++.h>
using namespace std;

int main () {
   int tc;
   scanf("%d",&tc);
   while (tc--) {
      int n;
      scanf("%d",&n);

      vector < int > x, y;
      x.resize(n); y.resize(n);

      for (int i=0; i<n; i++) {
         scanf("%d",&x[i]);
      }

      for (int i=0; i<n; i++) {
         scanf("%d",&y[i]);
      }

      sort(x.begin(),x.end());
      sort(y.rbegin(),y.rend());

      int cnt = 0;
      for (int i=0; i<n; i++) {
         if (x[i]%y[i]==0 or y[i]%x[i]==0) {
            cnt++;
         }
      }

      printf("%dn",cnt);
   }
   return 0;
}

coding problems solutions