int s1,s2,arr[t],i;
for(i=0;i<t;i++)
{cin>>s1>>s2;
arr[i]=s1-s2;}
sort(arr,arr+t);
if(abs(arr[0])>arr[t-1])
cout<<2<<" "<<abs(arr[0])<<endl;
else
cout<<1<<" "<<arr[t-1]<<endl;
int s1,s2,arr[t],i;
for(i=0;i<t;i++)
{cin>>s1>>s2;
arr[i]=s1-s2;}
sort(arr,arr+t);
if(abs(arr[0])>arr[t-1])
cout<<2<<" "<<abs(arr[0])<<endl;
else
cout<<1<<" "<<arr[t-1]<<endl;
The lead of previous round is carried over to next round. Did you account for that? See the table in the question carefully (or give a search on the forums- this Q has been asked multiple times)
The question is a bit unclear. Actually your solution is calculating lead, in each round. But the correct solution requires you to calculate the cumulative lead after each round.