Can someone help me debug grand temple code?

#include
using namespace std;
int main() {
int n;
pair<int,int>a[100],b[100];
int ar=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i].first>>a[i].second;
}

for(int i=0;i<n-1;i++)
{
	b[i].first=a[i].first-a[i+1].first;
	b[i].second=a[i].second-a[i+1].second;
	if(b[i].first<0)
	b[i].first=-1*b[i].first;
		if(b[i].second<0)
	b[i].second=-1*b[i].second;
    ar=max(ar,(b[i].first-1)*(b[i].second-1));

}
cout<<ar;
return 0;

}

Hi @Yashbansal2012, pls save your code on ide.codingblocks.com and share the URL here.