Submission #3291546

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;

vector<P> Search(map<ll,ll> &mp){
  vector<P> v;
  for(P p:mp){
    swap(p.first,p.second);
    v.push_back(p);
  }
  sort(v.begin(),v.end());
  reverse(v.begin(),v.end());
  return v;
}

ll n;
ll ans=(1LL<<60);
ll a[100005];
 
int main(){
  
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>a[i];
  }

  map<ll,ll> mp;
  ll ca=0;
  for(int i=0;i<n;i+=2){
    mp[ a[i] ]++;
    ca++;
  }

  vector<P> A=Search(mp);
  
  ll cb=0;
  mp.clear();
  for(int i=1;i<n;i+=2){
    mp[ a[i] ]++;
    cb++;
  }

  vector<P> B=Search(mp);
  A.push_back(P(0,-1));
  B.push_back(P(0,-2));

  for(int i=0;i<A.size();i++){
    if(i>3)break;
    for(int j=0;j<B.size();j++){
      if(j>3)break;
      if(A[i].second==B[j].second)continue;
      ans = min(ans, ca+cb-A[i].first-B[j].first);
    }
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Judge Result