Help me in solving TLG problem

help
,
1

My issue

My code

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int n;
	cin>>n;
	int a[n],b[n];
	for(int i=0;i<n;i++){
	    cin>>a[i];
	    
	    cout<<endl;
	    cin>>b[i];
	}
	int player1,player2=0;
	int lead1,lead2=0;
	for(int i=0;i<n;i++){
	    if(a[i]>b[i]){
	        player1++;
	        lead1=a[i]-b[i];
	        lead1++;
	    }
	    else if(b[i]>a[i]){
	        lead2=b[i]-a[i];
	        lead2++;
	        player2++;
	        
	    }
	    cout<<lead1<<" "<<lead2;
	}
	if(player2>player1 && lead1>lead2){
	    cout<<"2"<<lead1-lead2;
	}
	else{
	    cout<<"1"<<lead2-lead1;
	}
	return 0;
}

Problem Link: TLG Problem - CodeChef