Help me in solving AIRM problem

help
,
1

My issue

My code

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

int main() {
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        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];
        }
        vector <pair<int,int>> v;
        for(int i=0;i<n;i++)
        {
            v.push_back(make_pair(a[i],d[i]));
        }
        sort(v.begin(),v.end());
        int count=1;
        int ta=v[0].first;
        int td=v[0].second;
        for(int i=1;i<n;i++)
        {
         if(v[i].first<=td)
         {
            //  cout<<"hey";
             count++;
             td=min(td,v[i].second);
         }
     
    
        }
        
     cout<<count;  
     cout<<endl;
    }
	return 0;
}

Problem Link: AIRM Problem - CodeChef