Submission #3816714

---

Source Code Expand

#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define INF int(1e9+7)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;

int a[100005], b[100005];

int main()
{
	IO_OP;
	int n;
	cin >> n;
	for(int i=0;i<n;i++) {
		int t;
		cin >> t;
		if(i&1)
			b[t]++;
		else
			a[t]++;
	}
	vector<pi> u, v;
	for(int i=0;i<100005;i++) {
		u.PB({a[i], i});
		v.PB({b[i], i});
	}
	sort(u.begin(), u.end());
	sort(v.begin(), v.end());
	reverse(u.begin(), u.end());
	reverse(v.begin(), v.end());
	if(u[0].S != v[0].S) {
		cout << n - (u[0].F + v[0].F) << endl;
	} else {
		cout << n - max(u[0].F + v[1].F, u[1].F + v[0].F) << endl;
	}
}

Submission Info

Judge Result