Submission #4269224

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int n,ans=0;
struct ff
{
	int num;
	int where;
}a[100005];
bool comp(ff x,ff y)
{
	return x.num>y.num;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].num;
		a[i].where=i;
	}    
	sort(a+1,a+1+n,comp);
	
	for(int i=1;i<=n;i++)
	{
		if(i%2==0&&a[i].where%2!=0) ans++;
		if(i%2!=0&&a[i].where%2==0) ans++;
	}
	cout<<ans/2;
	return 0;
}

Submission Info

Judge Result