Submission #3300454

---

Source Code Expand

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

using namespace std;

using VI = vector<int>;
using VII = vector<pair<int, int> >;
using MII = map<int, int>;
const int X = 300000;


VII freqs(const MII& m) {
  VII v;
  for (auto const& kv: m) {
    v.push_back(make_pair(kv.second, kv.first));
  }
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  return v;
}

int main() {
  int N;
  cin >> N;
  MII ma, mb;
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    if (i % 2 == 0) {
      ma[a]++;
    } else {
      mb[a]++;
    }
  }
  ma[X] = 0;
  mb[X] = 0;

  VII fa = freqs(ma);
  VII fb = freqs(mb);

  int res;
  if (fa[0].second == fb[0].second) {
    res = min(N - fa[1].first - fb[0].first, N - fa[0].first - fb[1].first);
  } else {
    res = N - fa[0].first - fb[0].first;
  }

  cout << res << endl;

  return 0;
}

Submission Info

Judge Result