Can u give test case for the lead game

[shubham852702]

#include
#include
#include
using namespace std;
int main()
{
int n,arr[10000],brr[10000],i,max=0,diff,l;
cin>>n;
for(i=0;i<n;i++)
{
cin>>arr[i];
cin>>brr[i];
}
for(i=0;i<n;i++)
{
if(arr[i]>brr[i])
{
diff=arr[i]-brr[i];
if(diff>max)
{
max=diff;
l=1;
}

    }
   
     else if(arr[i]<brr[i])
    {
        diff=brr[i]-arr[i];
         if(diff>max) 
         {
        max=diff;
        l=2;
        }

    }
   

}
cout<<l<<" "<<max;

return 0;}

[sudheerays123]

@shubham852702

diff=arr[i]-brr[i];

This is not the difference they have told in the problem
Read it again

You have to take the difference of the sum of all a[i] till now and the sum of all b[i] till now