Submission #3303031

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int a1[100005],a2[100005],v[200005];
int t1,t2,t1_i,t2_i;

signed main(){

  int n; cin >> n;
  for(int i = 0; i < n; i++){
    cin >> v[i];
    if(i%2 != 0){
      a1[v[i]]++;
      if(t1 < a1[v[i]]){
        t1 = a1[v[i]];
        t1_i = v[i];
      }
    }
    else {
      a2[v[i]]++;
      if(t2 < a2[v[i]]){
        t2 = a2[v[i]];
        t2_i = v[i];
      }
    }
  }
  if(t1_i == t2_i){
    sort(a1,a1+100005);
    sort(a2,a2+100005);
    int ans = min((n/2-a2[100003]) + (n/2-t1), (n/2-a1[100003]) + (n/2-t2));
    cout << ans << endl;
    return 0;
  }
  //cout << t1 << " " << t2 << endl;
  cout << (n/2-t1) + (n/2-t2) << endl;

  return 0;
}

Submission Info

Judge Result