Submission #5989263

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
const int maxv=1e5+100;
int num[2][maxv];
int n,x;
struct point{
    int v,m;
};
bool cmp(point &a,point &b)
{
    return a.m>b.m;
}
point k1[maxv],k2[maxv];
int main()
{
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>x;
        num[i%2][x]++;
    }
    int cnt1=0,cnt2=0;
    for(int i=0;i<maxv;i++){
        if(num[0][i]>0){
            k1[cnt1].v=i;
            k1[cnt1].m=num[0][i];
            cnt1++;
        }
        if(num[1][i]>0){
            k2[cnt2].v=i;
            k2[cnt2].m=num[1][i];
            cnt2++;
        }
    }
    sort(k1,k1+cnt1,cmp);
    sort(k2,k2+cnt2,cmp);
    if(k1[0].v!=k2[0].v){
        cout<<n-k1[0].m-k2[0].m<<endl;
    }
    else {
        int n1,n2;
        n2=n/2;
        n1=n-n2;
        int ans=999999999;
        if(cnt1>1){
            ans=min(ans,n-k1[1].m-k2[0].m);
        }
        else ans=min(ans,n1+n2-k2[0].m);
        if(cnt2>1){
            ans=min(ans,n-k1[0].m-k2[1].m);
        }
        else ans=min(ans,n2+n1-k1[0].m);
        cout<<ans<<endl;
    }
    return 0;
}
/*
4
1 2 3 4
2
1 2
*/

Submission Info

Judge Result