Submission #4262458

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
long long read()
{
    long long x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
    {
        if(c=='-')
        {
            f=-1;
        }
        c=getchar();
    }
    while(c<='9'&&c>='0')
    {
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
int n;
struct node
{
    long long num;
	long long a;
    long long tot;
}s[100503];
bool cmp(node a,node b)
{
    return a.num<b.num;
}
long long ji,ou;
int main()
{
    n=read();
    for(int i=1;i<=n;++i)
        s[i].num=read(),s[i].a=i;
    stable_sort(s+1,s+1+n,cmp);
    for(int i=1;i<=n;++i)
    {
        if(s[i].a%2==0)
		{
            if(i%2==0)
                continue;
            else
                ou++;			
		} 
        else
		{
            if(i%2!=0)
                continue;
            else
                ji++;			
		}     	
	} 
    long long h=min(ou,ji);
    cout<<h+abs(ou-ji);
}

Submission Info

Judge Result