Submission #9813624

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;

using namespace std;

int main()
{
  int n;
  cin >> n;
  vector<int> f(100001, 0);
  vector<int> s(100001, 0);
  rep(i, n)
  {
    int x;
    cin >> x;
    if(i&1)
      s[x]++;
    else
      f[x]++;
  }
  auto maxf = max_element(f.begin(), f.end());
  auto maxs = max_element(s.begin(), s.end());
  int idxf = distance(f.begin(), maxf);
  int idxs = distance(s.begin(), maxs);

  int ans;
  if(idxf != idxs)
  {
    ans = n - *maxf - *maxs;
  }
  else
  {
    sort(s.begin(), s.end(), greater<int>());
    ans = n - *maxf - s[1];
  }
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result