Submission #3769313

---

Source Code Expand

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

typedef long long ll;
typedef pair<int,int> P;

const int INF = 1e9;
const int mod = 1e9+7;

int main()
{
    int n;
    cin >> n;
    map<int,int> mp[2];
    for(int i = 0; i < n; i++){
        int V;
        cin >> V;
        mp[i%2][V]++;
    }

    vector<P> v[2];
    for(int i = 0; i < 2; i++){
        for(auto j: mp[i]){
            v[i].emplace_back(j.second,j.first);
        }
        sort(v[i].rbegin(),v[i].rend());
        v[i].emplace_back(0,-1);
    }
    if(v[0][0].second == v[1][0].second){
        cout << min(n-v[0][0].first-v[1][1].first,n-v[0][1].first-v[1][0].first);
    }else{
        cout << n-v[0][0].first-v[1][0].first << endl;
    }
    return 0;
}

Submission Info

Judge Result