Help me in solving AIRM problem

help
,
1

My issue is that I have written the code but it is not working

My code

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int t,n;
	cin>>t;
	for(int i=1;i<=t;i++)
	{
	    cin>>n;
	    int a[n];
	    int d[n];
	    for(int i=0;i<n;i++)
	    {
	        cin>>a[i];
	    }
	    for(int i=0;i<n;i++)
	    {
	        cin>>d[i];
	    }
	    int count=0;
	    for(int i=0;i<n;i++)
	    {
	       
	    if(a[i]<=d[i])
	    {
	        count+=1;
	        
	    }
	    }
	    cout<<count<<endl;
	}
	return 0;
}

Problem Link: AIRM Problem - CodeChef

2

@misbahnoor
The logic is not right
The logic is to count the freq of the number of A[i] and D[i] and then print the max freq.